./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/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_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/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_3b0d47fd-9673-438e-9574-4b83f1db00bb/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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --- 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-26 00:01:12,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:01:12,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:01:13,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:01:13,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:01:13,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:01:13,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:01:13,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:01:13,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:01:13,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:01:13,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:01:13,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:01:13,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:01:13,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:01:13,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:01:13,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:01:13,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:01:13,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:01:13,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:01:13,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:01:13,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:01:13,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:01:13,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:01:13,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:01:13,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:01:13,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:01:13,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:01:13,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:01:13,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:01:13,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:01:13,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:01:13,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:01:13,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:01:13,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:01:13,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:01:13,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:01:13,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:01:13,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:01:13,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:01:13,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:01:13,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:01:13,048 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:01:13,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:01:13,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:01:13,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:01:13,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:01:13,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:01:13,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:01:13,111 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:01:13,111 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:01:13,112 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:01:13,112 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:01:13,112 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:01:13,112 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:01:13,112 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:01:13,113 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:01:13,113 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:01:13,113 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:01:13,113 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:01:13,113 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:01:13,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:01:13,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:01:13,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:01:13,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:01:13,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:01:13,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:01:13,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:01:13,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:01:13,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:01:13,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:01:13,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:01:13,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:01:13,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:01:13,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:01:13,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:01:13,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:01:13,120 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:01:13,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:01:13,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:01:13,121 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:01:13,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:01:13,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:01:13,122 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:01:13,122 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_3b0d47fd-9673-438e-9574-4b83f1db00bb/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_3b0d47fd-9673-438e-9574-4b83f1db00bb/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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 [2022-11-26 00:01:13,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:01:13,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:01:13,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:01:13,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:01:13,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:01:13,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-26 00:01:16,522 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:01:16,738 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:01:16,738 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-26 00:01:16,744 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/data/d2e60e1ef/28a6d860e14d4cff82fbd247ccda2880/FLAG50e70c2c5 [2022-11-26 00:01:16,764 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/data/d2e60e1ef/28a6d860e14d4cff82fbd247ccda2880 [2022-11-26 00:01:16,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:01:16,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:01:16,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:01:16,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:01:16,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:01:16,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:16" (1/1) ... [2022-11-26 00:01:16,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a59a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:16, skipping insertion in model container [2022-11-26 00:01:16,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:16" (1/1) ... [2022-11-26 00:01:16,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:01:16,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:01:17,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,086 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_3b0d47fd-9673-438e-9574-4b83f1db00bb/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-26 00:01:17,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:01:17,114 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:01:17,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:01:17,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:01:17,160 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_3b0d47fd-9673-438e-9574-4b83f1db00bb/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-26 00:01:17,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:01:17,179 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:01:17,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17 WrapperNode [2022-11-26 00:01:17,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:01:17,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:01:17,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:01:17,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:01:17,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,242 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-11-26 00:01:17,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:01:17,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:01:17,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:01:17,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:01:17,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,273 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:01:17,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:01:17,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:01:17,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:01:17,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (1/1) ... [2022-11-26 00:01:17,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:01:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:17,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:01:17,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:01:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:01:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:01:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:01:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:01:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-26 00:01:17,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-26 00:01:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-26 00:01:17,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-26 00:01:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-26 00:01:17,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-26 00:01:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:01:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 00:01:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 00:01:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:01:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:01:17,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:01:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:01:17,379 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:01:17,496 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:01:17,498 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:01:17,992 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:01:18,136 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:01:18,144 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-26 00:01:18,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:18 BoogieIcfgContainer [2022-11-26 00:01:18,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:01:18,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:01:18,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:01:18,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:01:18,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:01:16" (1/3) ... [2022-11-26 00:01:18,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb757cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:18, skipping insertion in model container [2022-11-26 00:01:18,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:17" (2/3) ... [2022-11-26 00:01:18,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb757cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:18, skipping insertion in model container [2022-11-26 00:01:18,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:18" (3/3) ... [2022-11-26 00:01:18,164 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-11-26 00:01:18,174 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:01:18,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:01:18,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:01:18,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:01:18,319 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-26 00:01:18,358 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:01:18,375 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 142 transitions, 308 flow [2022-11-26 00:01:18,379 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 142 transitions, 308 flow [2022-11-26 00:01:18,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 142 transitions, 308 flow [2022-11-26 00:01:18,472 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-11-26 00:01:18,474 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-26 00:01:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 10/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-26 00:01:18,486 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2022-11-26 00:01:26,524 INFO L134 LiptonReduction]: Checked pairs total: 2279 [2022-11-26 00:01:26,525 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-11-26 00:01:26,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 29 transitions, 82 flow [2022-11-26 00:01:26,570 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:26,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:01:26,602 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;@e4528cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:01:26,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 00:01:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:01:26,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:26,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:26,618 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-26 00:01:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1399168817, now seen corresponding path program 1 times [2022-11-26 00:01:26,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:26,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517105055] [2022-11-26 00:01:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:26,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:27,221 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-26 00:01:27,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517105055] [2022-11-26 00:01:27,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517105055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:27,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:27,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:01:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278396046] [2022-11-26 00:01:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:27,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:01:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:01:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:01:27,258 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:27,422 INFO L93 Difference]: Finished difference Result 117 states and 312 transitions. [2022-11-26 00:01:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:01:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:01:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:27,443 INFO L225 Difference]: With dead ends: 117 [2022-11-26 00:01:27,452 INFO L226 Difference]: Without dead ends: 117 [2022-11-26 00:01:27,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:27,459 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:27,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-26 00:01:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-11-26 00:01:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.7037037037037037) internal successors, (292), 108 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 292 transitions. [2022-11-26 00:01:27,502 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 292 transitions. Word has length 19 [2022-11-26 00:01:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:27,502 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 292 transitions. [2022-11-26 00:01:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 292 transitions. [2022-11-26 00:01:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:01:27,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:27,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:27,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:01:27,504 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-26 00:01:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash 86171445, now seen corresponding path program 2 times [2022-11-26 00:01:27,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:27,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715728587] [2022-11-26 00:01:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:27,641 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-26 00:01:27,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:27,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715728587] [2022-11-26 00:01:27,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715728587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:27,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:27,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:01:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859985172] [2022-11-26 00:01:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:27,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:01:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:01:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:01:27,645 INFO L87 Difference]: Start difference. First operand 109 states and 292 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:27,744 INFO L93 Difference]: Finished difference Result 121 states and 311 transitions. [2022-11-26 00:01:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:01:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:01:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:27,747 INFO L225 Difference]: With dead ends: 121 [2022-11-26 00:01:27,747 INFO L226 Difference]: Without dead ends: 121 [2022-11-26 00:01:27,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:27,748 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:27,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-26 00:01:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2022-11-26 00:01:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.611111111111111) internal successors, (282), 108 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 282 transitions. [2022-11-26 00:01:27,760 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 282 transitions. Word has length 19 [2022-11-26 00:01:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:27,761 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 282 transitions. [2022-11-26 00:01:27,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 282 transitions. [2022-11-26 00:01:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:01:27,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:27,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] [2022-11-26 00:01:27,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:01:27,763 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-26 00:01:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1838224039, now seen corresponding path program 3 times [2022-11-26 00:01:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:27,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531021740] [2022-11-26 00:01:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:28,029 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-26 00:01:28,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:28,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531021740] [2022-11-26 00:01:28,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531021740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:28,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:28,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:01:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151489352] [2022-11-26 00:01:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:28,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:01:28,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:28,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:01:28,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:28,033 INFO L87 Difference]: Start difference. First operand 109 states and 282 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:28,224 INFO L93 Difference]: Finished difference Result 195 states and 496 transitions. [2022-11-26 00:01:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:01:28,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:01:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:28,226 INFO L225 Difference]: With dead ends: 195 [2022-11-26 00:01:28,226 INFO L226 Difference]: Without dead ends: 123 [2022-11-26 00:01:28,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:01:28,227 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:28,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-26 00:01:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-11-26 00:01:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.5714285714285716) internal successors, (288), 112 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 288 transitions. [2022-11-26 00:01:28,238 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 288 transitions. Word has length 19 [2022-11-26 00:01:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:28,239 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 288 transitions. [2022-11-26 00:01:28,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 288 transitions. [2022-11-26 00:01:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:01:28,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:28,252 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-26 00:01:28,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:01:28,253 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-26 00:01:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 692457881, now seen corresponding path program 1 times [2022-11-26 00:01:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:28,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534022921] [2022-11-26 00:01:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:28,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:28,466 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-26 00:01:28,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:28,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534022921] [2022-11-26 00:01:28,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534022921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:28,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:28,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:01:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496933228] [2022-11-26 00:01:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:01:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:01:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:01:28,478 INFO L87 Difference]: Start difference. First operand 113 states and 288 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 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-26 00:01:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:28,531 INFO L93 Difference]: Finished difference Result 99 states and 242 transitions. [2022-11-26 00:01:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:01:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 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-26 00:01:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:28,535 INFO L225 Difference]: With dead ends: 99 [2022-11-26 00:01:28,535 INFO L226 Difference]: Without dead ends: 99 [2022-11-26 00:01:28,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:01:28,540 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:28,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:01:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-26 00:01:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-26 00:01:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.4693877551020407) internal successors, (242), 98 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2022-11-26 00:01:28,561 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 21 [2022-11-26 00:01:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:28,561 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2022-11-26 00:01:28,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 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-26 00:01:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2022-11-26 00:01:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:01:28,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:28,568 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-26 00:01:28,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:01:28,568 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-26 00:01:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1645894438, now seen corresponding path program 1 times [2022-11-26 00:01:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:28,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099604661] [2022-11-26 00:01:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:28,726 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-26 00:01:28,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099604661] [2022-11-26 00:01:28,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099604661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:28,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:28,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:01:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536327197] [2022-11-26 00:01:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:01:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:01:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:01:28,730 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:28,808 INFO L93 Difference]: Finished difference Result 121 states and 279 transitions. [2022-11-26 00:01:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:01:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-26 00:01:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:28,810 INFO L225 Difference]: With dead ends: 121 [2022-11-26 00:01:28,810 INFO L226 Difference]: Without dead ends: 100 [2022-11-26 00:01:28,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:28,811 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:28,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-26 00:01:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-26 00:01:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4545454545454546) internal successors, (243), 99 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 243 transitions. [2022-11-26 00:01:28,827 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 243 transitions. Word has length 23 [2022-11-26 00:01:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:28,828 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 243 transitions. [2022-11-26 00:01:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 243 transitions. [2022-11-26 00:01:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:01:28,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:28,830 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-26 00:01:28,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:01:28,830 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-26 00:01:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1730833695, now seen corresponding path program 1 times [2022-11-26 00:01:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063464682] [2022-11-26 00:01:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:30,355 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-26 00:01:30,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063464682] [2022-11-26 00:01:30,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063464682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775633530] [2022-11-26 00:01:30,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:30,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:30,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:30,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:30,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:01:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:30,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-26 00:01:30,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:30,766 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-26 00:01:30,883 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-26 00:01:30,959 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-26 00:01:31,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:01:31,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:01:31,325 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 23 treesize of output 7 [2022-11-26 00:01:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:01:31,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:31,907 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-26 00:01:32,244 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)) 1))))) (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)))) (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1))))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-26 00:01:32,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:32,595 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 65 treesize of output 53 [2022-11-26 00:01:32,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:32,624 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 402 treesize of output 390 [2022-11-26 00:01:32,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:32,645 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 378 treesize of output 354 [2022-11-26 00:01:32,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:32,676 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 203 treesize of output 197 [2022-11-26 00:01:32,692 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 278 treesize of output 230 [2022-11-26 00:01:33,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:33,406 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 65 treesize of output 53 [2022-11-26 00:01:33,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:01:33,430 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-26 00:01:33,431 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 316 treesize of output 288 [2022-11-26 00:01:33,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:01:33,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 188 [2022-11-26 00:01:33,477 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-26 00:01:33,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 216 [2022-11-26 00:01:33,743 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-26 00:01:33,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775633530] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:33,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1469096810] [2022-11-26 00:01:33,753 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-26 00:01:33,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:33,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 32 [2022-11-26 00:01:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764292799] [2022-11-26 00:01:33,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 00:01:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 00:01:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=794, Unknown=6, NotChecked=118, Total=1056 [2022-11-26 00:01:33,762 INFO L87 Difference]: Start difference. First operand 100 states and 243 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:34,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (= c_~sum~0 0))) (and (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse0) (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 1))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= c_~v_assert~0 1) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= c_~back~0 c_~front~0) (<= (+ c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-26 00:01:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:49,610 INFO L93 Difference]: Finished difference Result 528 states and 1387 transitions. [2022-11-26 00:01:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-26 00:01:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 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-26 00:01:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:49,614 INFO L225 Difference]: With dead ends: 528 [2022-11-26 00:01:49,614 INFO L226 Difference]: Without dead ends: 408 [2022-11-26 00:01:49,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=759, Invalid=4071, Unknown=12, NotChecked=414, Total=5256 [2022-11-26 00:01:49,617 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 41 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:49,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 22 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1196 Invalid, 25 Unknown, 343 Unchecked, 1.9s Time] [2022-11-26 00:01:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-26 00:01:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 156. [2022-11-26 00:01:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.4193548387096775) internal successors, (375), 155 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 375 transitions. [2022-11-26 00:01:49,627 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 375 transitions. Word has length 24 [2022-11-26 00:01:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:49,627 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 375 transitions. [2022-11-26 00:01:49,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 375 transitions. [2022-11-26 00:01:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:01:49,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:49,629 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:49,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:01:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 00:01:49,839 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-26 00:01:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1360235328, now seen corresponding path program 2 times [2022-11-26 00:01:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:49,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232964089] [2022-11-26 00:01:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:01:51,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:51,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232964089] [2022-11-26 00:01:51,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232964089] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:51,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094317809] [2022-11-26 00:01:51,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:01:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:51,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:51,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:01:51,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:01:51,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:01:51,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-26 00:01:51,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:51,629 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 23 treesize of output 7 [2022-11-26 00:01:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:01:51,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:52,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:52,013 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 68 treesize of output 48 [2022-11-26 00:01:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:01:52,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094317809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:52,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [938530114] [2022-11-26 00:01:52,353 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-26 00:01:52,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 25 [2022-11-26 00:01:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96984002] [2022-11-26 00:01:52,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:52,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:01:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:01:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:01:52,358 INFO L87 Difference]: Start difference. First operand 156 states and 375 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:54,864 INFO L93 Difference]: Finished difference Result 325 states and 793 transitions. [2022-11-26 00:01:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:01:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 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-26 00:01:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:54,866 INFO L225 Difference]: With dead ends: 325 [2022-11-26 00:01:54,866 INFO L226 Difference]: Without dead ends: 295 [2022-11-26 00:01:54,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=504, Invalid=2252, Unknown=0, NotChecked=0, Total=2756 [2022-11-26 00:01:54,868 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 356 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:54,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 8 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:01:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-26 00:01:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 154. [2022-11-26 00:01:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.457516339869281) internal successors, (376), 153 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 376 transitions. [2022-11-26 00:01:54,878 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 376 transitions. Word has length 25 [2022-11-26 00:01:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:54,878 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 376 transitions. [2022-11-26 00:01:54,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 376 transitions. [2022-11-26 00:01:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:01:54,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:54,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:54,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:01:55,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 00:01:55,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:01:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 344798696, now seen corresponding path program 3 times [2022-11-26 00:01:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:55,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375362032] [2022-11-26 00:01:55,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:01:56,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375362032] [2022-11-26 00:01:56,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375362032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432544494] [2022-11-26 00:01:56,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:01:56,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:56,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:56,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:56,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:01:56,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:01:56,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:01:56,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 00:01:56,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:57,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:01:57,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:01:57,206 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 23 treesize of output 7 [2022-11-26 00:01:57,296 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-26 00:01:57,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:57,511 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_246 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-26 00:01:57,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:01:57,555 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 110 treesize of output 90 [2022-11-26 00:01:57,563 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 53 treesize of output 47 [2022-11-26 00:01:57,570 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 47 treesize of output 41 [2022-11-26 00:01:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:01:58,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432544494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270578394] [2022-11-26 00:01:58,045 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-26 00:01:58,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:58,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2022-11-26 00:01:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483592605] [2022-11-26 00:01:58,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:58,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-26 00:01:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-26 00:01:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=601, Unknown=1, NotChecked=50, Total=756 [2022-11-26 00:01:58,052 INFO L87 Difference]: Start difference. First operand 154 states and 376 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:59,817 INFO L93 Difference]: Finished difference Result 287 states and 704 transitions. [2022-11-26 00:01:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:01:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-26 00:01:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:59,819 INFO L225 Difference]: With dead ends: 287 [2022-11-26 00:01:59,820 INFO L226 Difference]: Without dead ends: 233 [2022-11-26 00:01:59,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=294, Invalid=1269, Unknown=1, NotChecked=76, Total=1640 [2022-11-26 00:01:59,821 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 257 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:59,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 13 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 536 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2022-11-26 00:01:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-26 00:01:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 116. [2022-11-26 00:01:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.4956521739130433) internal successors, (287), 115 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 287 transitions. [2022-11-26 00:01:59,834 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 287 transitions. Word has length 25 [2022-11-26 00:01:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:59,836 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 287 transitions. [2022-11-26 00:01:59,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:01:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 287 transitions. [2022-11-26 00:01:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:01:59,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:59,841 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-26 00:01:59,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:02:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:00,042 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-26 00:02:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:02:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash -450490749, now seen corresponding path program 4 times [2022-11-26 00:02:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:02:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086201845] [2022-11-26 00:02:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:02:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:02:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:02:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:02:00,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:02:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086201845] [2022-11-26 00:02:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086201845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:02:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842942790] [2022-11-26 00:02:00,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:02:00,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:02:00,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:02:00,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:02:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:02:00,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:02:00,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:02:00,594 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 124 treesize of output 92 [2022-11-26 00:02:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:02:00,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:02:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842942790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:02:00,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:02:00,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-11-26 00:02:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084506486] [2022-11-26 00:02:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:02:00,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:02:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:02:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:02:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:02:00,644 INFO L87 Difference]: Start difference. First operand 116 states and 287 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:02:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:02:00,745 INFO L93 Difference]: Finished difference Result 284 states and 691 transitions. [2022-11-26 00:02:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:02:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-26 00:02:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:02:00,747 INFO L225 Difference]: With dead ends: 284 [2022-11-26 00:02:00,747 INFO L226 Difference]: Without dead ends: 282 [2022-11-26 00:02:00,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:02:00,748 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:02:00,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 11 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:02:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-26 00:02:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 240. [2022-11-26 00:02:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.598326359832636) internal successors, (621), 239 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:02:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 621 transitions. [2022-11-26 00:02:00,758 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 621 transitions. Word has length 26 [2022-11-26 00:02:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:02:00,758 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 621 transitions. [2022-11-26 00:02:00,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:02:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 621 transitions. [2022-11-26 00:02:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:02:00,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:02:00,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:02:00,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:02:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:00,967 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-26 00:02:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:02:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 744618326, now seen corresponding path program 5 times [2022-11-26 00:02:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:02:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218242654] [2022-11-26 00:02:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:02:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:02:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:02:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:02:01,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:02:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218242654] [2022-11-26 00:02:01,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218242654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:02:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299715868] [2022-11-26 00:02:01,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:02:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:02:01,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:02:01,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:02:01,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:02:01,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:02:01,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:02:01,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:02:01,476 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 124 treesize of output 92 [2022-11-26 00:02:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:02:01,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:02:01,671 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 136 treesize of output 104 [2022-11-26 00:02:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:02:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299715868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:02:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397381645] [2022-11-26 00:02:01,755 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-26 00:02:01,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:02:01,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-26 00:02:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553297351] [2022-11-26 00:02:01,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:02:01,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:02:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:02:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:02:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:02:01,760 INFO L87 Difference]: Start difference. First operand 240 states and 621 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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-26 00:02:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:02:01,976 INFO L93 Difference]: Finished difference Result 294 states and 730 transitions. [2022-11-26 00:02:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:02:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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 28 [2022-11-26 00:02:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:02:01,979 INFO L225 Difference]: With dead ends: 294 [2022-11-26 00:02:01,979 INFO L226 Difference]: Without dead ends: 241 [2022-11-26 00:02:01,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:02:01,980 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:02:01,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:02:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-26 00:02:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-26 00:02:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.591666666666667) internal successors, (622), 240 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:02:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 622 transitions. [2022-11-26 00:02:01,992 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 622 transitions. Word has length 28 [2022-11-26 00:02:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:02:01,992 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 622 transitions. [2022-11-26 00:02:01,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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-26 00:02:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 622 transitions. [2022-11-26 00:02:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:02:01,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:02:01,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:02:02,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:02:02,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:02:02,202 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-26 00:02:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:02:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1285067825, now seen corresponding path program 6 times [2022-11-26 00:02:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:02:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517606520] [2022-11-26 00:02:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:02:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:02:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:02:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:02:03,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:02:03,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517606520] [2022-11-26 00:02:03,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517606520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:02:03,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211515024] [2022-11-26 00:02:03,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:02:03,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:03,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:02:03,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:02:03,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:02:04,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:02:04,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:02:04,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-26 00:02:04,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:02:04,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:02:04,392 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-26 00:02:04,494 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-26 00:02:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:02:04,987 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 32 treesize of output 32 [2022-11-26 00:02:05,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:02:05,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 14 [2022-11-26 00:02:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:02:05,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:02:06,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~front~0 1))) (or (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse4 (+ c_~queue~0.offset .cse11 4)) (.cse6 (+ c_~queue~0.offset .cse10))) (and (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse0 (select .cse5 c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (not (= (select .cse0 .cse6) 1)))))) (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse7 (select .cse9 c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4))) 1)) (not (= (select .cse7 .cse6) 1))))))))) (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (< .cse12 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse12))) is different from false [2022-11-26 00:02:07,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:02:07,323 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 129 treesize of output 93 [2022-11-26 00:02:07,377 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:02:07,378 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 4098 treesize of output 3830 [2022-11-26 00:02:07,450 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:02:07,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3792 treesize of output 3596 [2022-11-26 00:02:07,535 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:02:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3558 treesize of output 3128 [2022-11-26 00:02:07,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:02:07,583 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 2870 treesize of output 2038 [2022-11-26 00:02:10,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:02:10,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2022-11-26 00:02:10,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:02:10,777 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:02:10,778 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 562 treesize of output 502 [2022-11-26 00:02:10,814 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:02:10,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 398 [2022-11-26 00:02:10,855 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:02:10,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 390 treesize of output 346 [2022-11-26 00:02:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:02:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211515024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:02:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712832353] [2022-11-26 00:02:11,281 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-26 00:02:11,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:02:11,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2022-11-26 00:02:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553455124] [2022-11-26 00:02:11,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:02:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-26 00:02:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:02:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-26 00:02:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1210, Unknown=12, NotChecked=74, Total=1560 [2022-11-26 00:02:11,293 INFO L87 Difference]: Start difference. First operand 241 states and 622 transitions. Second operand has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:02:13,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_~front~0 4)) (.cse18 (* c_~back~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse18)) (.cse22 (+ c_~front~0 1)) (.cse4 (+ c_~queue~0.offset .cse17 4)) (.cse3 (+ c_~queue~0.offset .cse17)) (.cse23 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (+ c_~queue~0.offset .cse18 4))) (let ((.cse10 (= (mod c_~v_assert~0 256) 0)) (.cse16 (<= 0 c_~sum~0)) (.cse11 (<= (+ c_~back~0 1) c_~front~0)) (.cse19 (not (= (+ (select .cse23 .cse1) 1) 0))) (.cse20 (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse24 .cse4) (select .cse24 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse25 .cse4) (select .cse25 .cse3))) 1)))) (.cse12 (< .cse22 0)) (.cse13 (not (< c_~back~0 c_~n~0))) (.cse21 (not (= (select .cse23 .cse6) 1))) (.cse14 (not (<= 0 c_~back~0))) (.cse15 (<= c_~n~0 .cse22))) (and (or (and (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse0 (select .cse5 c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (not (= (select .cse0 .cse6) 1)))))) (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse7 (select .cse9 c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4))) 1)) (not (= (select .cse7 .cse6) 1))))))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse16 (<= c_~sum~0 1) (= .cse17 .cse18)) .cse10 .cse11 .cse12 .cse13 .cse14 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse21 .cse14 .cse15) (<= 1 c_~v_assert~0) .cse16 (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse11 .cse19 .cse20 .cse12 .cse13 .cse21 .cse14 .cse15))))) is different from false [2022-11-26 00:02:19,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1)) (.cse9 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (not (= (+ (select .cse9 (+ c_~queue~0.offset .cse10 4)) 1) 0))) (.cse2 (let ((.cse15 (* c_~front~0 4))) (let ((.cse12 (+ c_~queue~0.offset .cse15 4)) (.cse13 (+ c_~queue~0.offset .cse15))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse11 .cse12) (select .cse11 .cse13))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse14 .cse12) (select .cse14 .cse13))) 1)))))) (.cse3 (< .cse8 0)) (.cse4 (not (< c_~back~0 c_~n~0))) (.cse5 (not (= (select .cse9 (+ c_~queue~0.offset .cse10)) 1))) (.cse6 (not (<= 0 c_~back~0))) (.cse7 (<= c_~n~0 .cse8))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) is different from false [2022-11-26 00:02:20,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1)) (.cse9 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (not (= (+ (select .cse9 (+ c_~queue~0.offset .cse10 4)) 1) 0))) (.cse2 (let ((.cse15 (* c_~front~0 4))) (let ((.cse12 (+ c_~queue~0.offset .cse15 4)) (.cse13 (+ c_~queue~0.offset .cse15))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse11 .cse12) (select .cse11 .cse13))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse14 .cse12) (select .cse14 .cse13))) 1)))))) (.cse3 (< .cse8 0)) (.cse4 (not (< c_~back~0 c_~n~0))) (.cse5 (not (= (select .cse9 (+ c_~queue~0.offset .cse10)) 1))) (.cse6 (not (<= 0 c_~back~0))) (.cse7 (<= c_~n~0 .cse8))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) is different from false [2022-11-26 00:02:21,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (let ((.cse1 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (.cse2 (let ((.cse12 (* c_~front~0 4))) (let ((.cse9 (+ c_~queue~0.offset .cse12 4)) (.cse10 (+ c_~queue~0.offset .cse12))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse9) (select .cse8 .cse10))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse11 .cse9) (select .cse11 .cse10))) 1)))))) (.cse3 (< .cse0 0)) (.cse4 (<= c_~n~0 .cse0))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= c_~back~0 .cse0) .cse1 .cse2 .cse3 .cse4) (or (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) .cse1 .cse2 .cse3 .cse4) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-11-26 00:02:21,802 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-26 00:02:25,362 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (<= 1 c_~v_assert~0)) is different from false [2022-11-26 00:02:25,619 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~front~0 4))) (let ((.cse14 (+ c_~front~0 1)) (.cse2 (+ c_~queue~0.offset .cse3)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (* c_~back~0 4))) (let ((.cse5 (= (mod c_~v_assert~0 256) 0)) (.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse11 (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse4 4)) 1) 0))) (.cse12 (let ((.cse16 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse15 .cse16) (select .cse15 .cse2))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse17 .cse16) (select .cse17 .cse2))) 1))))) (.cse7 (< .cse14 0)) (.cse8 (not (< c_~back~0 c_~n~0))) (.cse13 (not (= (select .cse1 (+ c_~queue~0.offset .cse4)) 1))) (.cse9 (not (<= 0 c_~back~0))) (.cse10 (<= c_~n~0 .cse14))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2)))) (and (<= .cse0 1) (<= 0 .cse0))) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse3 .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10) (or .cse5 .cse6 .cse11 .cse12 .cse7 .cse8 .cse13 .cse9 .cse10) (<= 1 c_~v_assert~0) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse6 .cse11 .cse12 .cse7 .cse8 .cse13 .cse9 .cse10))))) is different from false [2022-11-26 00:02:28,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~front~0 4))) (let ((.cse14 (+ c_~front~0 1)) (.cse2 (+ c_~queue~0.offset .cse3)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (* c_~back~0 4))) (let ((.cse5 (= (mod c_~v_assert~0 256) 0)) (.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse11 (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse4 4)) 1) 0))) (.cse12 (let ((.cse16 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse15 .cse16) (select .cse15 .cse2))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse17 .cse16) (select .cse17 .cse2))) 1))))) (.cse7 (< .cse14 0)) (.cse8 (not (< c_~back~0 c_~n~0))) (.cse13 (not (= (select .cse1 (+ c_~queue~0.offset .cse4)) 1))) (.cse9 (not (<= 0 c_~back~0))) (.cse10 (<= c_~n~0 .cse14))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2)))) (and (<= .cse0 1) (<= 0 .cse0))) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse3 .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10) (or .cse5 .cse6 .cse11 .cse12 .cse7 .cse8 .cse13 .cse9 .cse10) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse6 .cse11 .cse12 .cse7 .cse8 .cse13 .cse9 .cse10))))) is different from false [2022-11-26 00:02:56,525 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-26 00:02:57,922 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-26 00:03:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:03:01,665 INFO L93 Difference]: Finished difference Result 1929 states and 4771 transitions. [2022-11-26 00:03:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-26 00:03:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-26 00:03:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:03:01,676 INFO L225 Difference]: With dead ends: 1929 [2022-11-26 00:03:01,676 INFO L226 Difference]: Without dead ends: 1763 [2022-11-26 00:03:01,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 7584 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=3235, Invalid=17361, Unknown=328, NotChecked=3256, Total=24180 [2022-11-26 00:03:01,682 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1259 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 162 mSolverCounterUnsat, 103 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 103 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:03:01,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 43 Invalid, 4418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3424 Invalid, 103 Unknown, 729 Unchecked, 7.3s Time] [2022-11-26 00:03:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-11-26 00:03:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 549. [2022-11-26 00:03:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 2.633211678832117) internal successors, (1443), 548 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:03:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1443 transitions. [2022-11-26 00:03:01,720 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1443 transitions. Word has length 29 [2022-11-26 00:03:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:03:01,720 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1443 transitions. [2022-11-26 00:03:01,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:03:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1443 transitions. [2022-11-26 00:03:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:03:01,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:03:01,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:03:01,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 00:03:01,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:03:01,930 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-26 00:03:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:03:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1694637719, now seen corresponding path program 7 times [2022-11-26 00:03:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:03:01,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184758761] [2022-11-26 00:03:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:03:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:03:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:03:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:03:03,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:03:03,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184758761] [2022-11-26 00:03:03,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184758761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:03:03,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327116344] [2022-11-26 00:03:03,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:03:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:03:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:03:03,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:03:03,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:03:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:03:03,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-26 00:03:03,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:03:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:03:04,263 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 44 treesize of output 42 [2022-11-26 00:03:04,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:03:04,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2022-11-26 00:03:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:03:04,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:03:04,745 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-26 00:03:05,109 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:03:05,109 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 286 treesize of output 240 [2022-11-26 00:03:05,127 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 59 treesize of output 52 [2022-11-26 00:03:05,153 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 52 treesize of output 45 [2022-11-26 00:03:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:03:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327116344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:03:06,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476046042] [2022-11-26 00:03:06,371 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-26 00:03:06,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:03:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 36 [2022-11-26 00:03:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351765157] [2022-11-26 00:03:06,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:03:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:03:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:03:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:03:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1078, Unknown=9, NotChecked=68, Total=1332 [2022-11-26 00:03:06,375 INFO L87 Difference]: Start difference. First operand 549 states and 1443 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:03:17,454 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-26 00:03:19,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-11-26 00:03:19,760 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-26 00:03:21,410 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-26 00:03:22,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-11-26 00:03:23,315 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-11-26 00:03:26,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-11-26 00:03:46,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6))))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or .cse0 (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) .cse4 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or .cse0 .cse4)))) is different from false [2022-11-26 00:03:46,479 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6))))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse0 (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) .cse4 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or .cse0 .cse4)))) is different from false [2022-11-26 00:03:54,996 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 107 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:05:08,787 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:05:36,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:06:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:03,736 INFO L93 Difference]: Finished difference Result 4152 states and 10313 transitions. [2022-11-26 00:06:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2022-11-26 00:06:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-26 00:06:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:03,753 INFO L225 Difference]: With dead ends: 4152 [2022-11-26 00:06:03,753 INFO L226 Difference]: Without dead ends: 3234 [2022-11-26 00:06:03,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 277 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 30034 ImplicationChecksByTransitivity, 162.5s TimeCoverageRelationStatistics Valid=9011, Invalid=61861, Unknown=1260, NotChecked=5430, Total=77562 [2022-11-26 00:06:03,765 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 933 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5303 mSolverCounterSat, 261 mSolverCounterUnsat, 824 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 5303 IncrementalHoareTripleChecker+Invalid, 824 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:03,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 95 Invalid, 6696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [261 Valid, 5303 Invalid, 824 Unknown, 308 Unchecked, 15.5s Time] [2022-11-26 00:06:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2022-11-26 00:06:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 1184. [2022-11-26 00:06:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 2.7328825021132714) internal successors, (3233), 1183 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:06:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 3233 transitions. [2022-11-26 00:06:03,835 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 3233 transitions. Word has length 29 [2022-11-26 00:06:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:03,835 INFO L495 AbstractCegarLoop]: Abstraction has 1184 states and 3233 transitions. [2022-11-26 00:06:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:06:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 3233 transitions. [2022-11-26 00:06:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:06:03,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:03,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:03,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:04,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:06:04,045 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-26 00:06:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 117375099, now seen corresponding path program 8 times [2022-11-26 00:06:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:04,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457816592] [2022-11-26 00:06:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:05,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:05,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457816592] [2022-11-26 00:06:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457816592] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:05,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698703672] [2022-11-26 00:06:05,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:06:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:05,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:05,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:06:06,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:06:06,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:06,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-26 00:06:06,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:06,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:06:06,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:06:06,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:06:06,992 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 50 treesize of output 14 [2022-11-26 00:06:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:06:07,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:08,171 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse7 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10)) (.cse2 (+ c_~queue~0.offset .cse10 4))) (and (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2)) 1)))) .cse7 .cse4) (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2)) 1) (not (= (select .cse8 .cse3) 1))))) .cse4 .cse5) (or .cse7 .cse4 (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse3) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)))))))))) (< (+ c_~front~0 1) 0) (not (< c_~back~0 c_~n~0))) is different from false [2022-11-26 00:06:08,514 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-11-26 00:06:08,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 516 treesize of output 424 [2022-11-26 00:06:08,561 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-26 00:06:08,562 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 279 treesize of output 275 [2022-11-26 00:06:08,608 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-26 00:06:08,609 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 260 treesize of output 256 [2022-11-26 00:06:08,661 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-26 00:06:08,662 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 241 treesize of output 237 [2022-11-26 00:06:08,709 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-26 00:06:08,710 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 222 treesize of output 218 [2022-11-26 00:06:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:06:11,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698703672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:11,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899955138] [2022-11-26 00:06:11,274 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-26 00:06:11,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:11,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2022-11-26 00:06:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339732583] [2022-11-26 00:06:11,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:11,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:06:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:06:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1033, Unknown=1, NotChecked=68, Total=1332 [2022-11-26 00:06:11,282 INFO L87 Difference]: Start difference. First operand 1184 states and 3233 transitions. Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:06:44,133 WARN L233 SmtUtils]: Spent 27.10s on a formula simplification. DAG size of input: 117 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:06:45,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse15 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse11))) (let ((.cse0 (select .cse15 .cse2))) (let ((.cse12 (+ c_~front~0 1)) (.cse14 (+ c_~sum~0 .cse0)) (.cse13 (select .cse15 (+ c_~queue~0.offset .cse11 (- 4))))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (< c_~front~0 c_~n~0) (= (+ .cse0 1) 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse6)) (.cse5 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse3 (+ c_~queue~0.offset .cse11 4))) (and (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (select .cse1 .cse4) 1))))) .cse5 .cse6) (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse8 .cse5) (or (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1) (not (= (select .cse9 .cse4) 1))))) .cse5 .cse6) (or .cse8 .cse5 (forall ((v_ArrVal_485 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_485) c_~queue~0.base))) (or (not (= (+ (select .cse10 .cse4) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse10 .cse2) (select .cse10 .cse3)))))))))) (< .cse12 0) (not (< c_~back~0 c_~n~0))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (= c_~sum~0 .cse13) (= .cse12 c_~back~0) (<= .cse14 0) (= c_~queue~0.offset 0) (<= 0 .cse14) (<= 1 c_~v_assert~0) (= .cse13 1) (<= 1 c_~front~0) (<= c_~n~0 2)))))) is different from false [2022-11-26 00:07:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:18,676 INFO L93 Difference]: Finished difference Result 6294 states and 16796 transitions. [2022-11-26 00:07:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-11-26 00:07:18,677 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-26 00:07:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:18,695 INFO L225 Difference]: With dead ends: 6294 [2022-11-26 00:07:18,695 INFO L226 Difference]: Without dead ends: 4658 [2022-11-26 00:07:18,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11157 ImplicationChecksByTransitivity, 65.3s TimeCoverageRelationStatistics Valid=4196, Invalid=25213, Unknown=11, NotChecked=682, Total=30102 [2022-11-26 00:07:18,699 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1093 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 114 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:18,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 3 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2154 Invalid, 19 Unknown, 374 Unchecked, 3.9s Time] [2022-11-26 00:07:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2022-11-26 00:07:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 1933. [2022-11-26 00:07:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1932 states have (on average 2.739130434782609) internal successors, (5292), 1932 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 5292 transitions. [2022-11-26 00:07:18,811 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 5292 transitions. Word has length 29 [2022-11-26 00:07:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 1933 states and 5292 transitions. [2022-11-26 00:07:18,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 5292 transitions. [2022-11-26 00:07:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:07:18,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:18,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:18,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:19,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:07:19,024 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-26 00:07:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash 219158613, now seen corresponding path program 9 times [2022-11-26 00:07:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:19,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082546699] [2022-11-26 00:07:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:20,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082546699] [2022-11-26 00:07:20,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082546699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762842695] [2022-11-26 00:07:20,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:07:20,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:20,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:20,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:20,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:07:20,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:07:20,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:20,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-26 00:07:20,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:21,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:07:21,132 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-26 00:07:21,234 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-26 00:07:21,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:21,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:07:22,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:22,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 14 [2022-11-26 00:07:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:22,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:22,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse5)) (.cse0 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (or .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1))))) .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (select .cse6 .cse4) 1))))) .cse0 .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))) (not (= (+ (select .cse7 .cse4) 1) 0))))) .cse8 .cse0) (or .cse8 .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< .cse11 0) (<= c_~n~0 .cse11))) is different from false [2022-11-26 00:07:24,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (< .cse0 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse10)) (.cse4 (+ c_~queue~0.offset .cse11 4)) (.cse5 (+ c_~queue~0.offset .cse11)) (.cse6 (+ c_~queue~0.offset .cse10 4)) (.cse7 (<= (+ c_~back~0 1) c_~front~0))) (and (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse3 (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (select (select .cse1 c_~queue~0.base) .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5))) (not (= (+ (select .cse3 .cse6) 1) 0)))))) .cse7) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse9 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (select (select .cse8 c_~queue~0.base) .cse2) 1)) (<= (+ c_~sum~0 (select .cse9 .cse4) (select .cse9 .cse5)) 1) (not (= (+ (select .cse9 .cse6) 1) 0)))))) .cse7)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse0))) is different from false [2022-11-26 00:07:24,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:24,491 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 132 treesize of output 96 [2022-11-26 00:07:24,555 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:07:24,556 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 978 treesize of output 948 [2022-11-26 00:07:24,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:24,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:24,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 772 treesize of output 624 [2022-11-26 00:07:24,657 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:07:24,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 750 treesize of output 684 [2022-11-26 00:07:24,748 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-11-26 00:07:24,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 646 treesize of output 632 [2022-11-26 00:07:27,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:07:27,793 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 132 treesize of output 96 [2022-11-26 00:07:27,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:27,833 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:07:27,834 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 266 treesize of output 240 [2022-11-26 00:07:27,871 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:07:27,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2022-11-26 00:07:27,910 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-26 00:07:27,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2022-11-26 00:07:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:07:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762842695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269968823] [2022-11-26 00:07:28,573 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-26 00:07:28,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:28,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2022-11-26 00:07:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019458461] [2022-11-26 00:07:28,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:28,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-26 00:07:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-26 00:07:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1190, Unknown=9, NotChecked=146, Total=1560 [2022-11-26 00:07:28,577 INFO L87 Difference]: Start difference. First operand 1933 states and 5292 transitions. Second operand has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:07:53,360 WARN L233 SmtUtils]: Spent 24.68s on a formula simplification. DAG size of input: 96 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:07:55,328 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse11 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse9 (* c_~back~0 4)) (.cse10 (* c_~front~0 4))) (let ((.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse4 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse2 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (not (= (+ (select .cse2 .cse3) 1) 0)) (<= 0 (+ (select .cse2 .cse4) c_~sum~0 (select .cse2 .cse5))))))) .cse6) (or .cse6 (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse7 .cse4) c_~sum~0 (select .cse7 .cse5)) 1) (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (not (= (+ (select .cse7 .cse3) 1) 0)))))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse11 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse11)))) is different from false [2022-11-26 00:08:11,153 WARN L233 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 141 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:08:12,824 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse5)) (.cse0 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (or .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1))))) .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (select .cse6 .cse4) 1))))) .cse0 .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))) (not (= (+ (select .cse7 .cse4) 1) 0))))) .cse8 .cse0) (or .cse8 .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< .cse11 0) (<= c_~n~0 .cse11))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-26 00:08:16,182 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse5)) (.cse0 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (or .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1))))) .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (select .cse6 .cse4) 1))))) .cse0 .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))) (not (= (+ (select .cse7 .cse4) 1) 0))))) .cse8 .cse0) (or .cse8 .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< .cse11 0) (<= c_~n~0 .cse11)))) is different from false [2022-11-26 00:08:36,354 WARN L233 SmtUtils]: Spent 12.80s on a formula simplification. DAG size of input: 166 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:08:37,134 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse5)) (.cse0 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (or .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1))))) .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (select .cse6 .cse4) 1))))) .cse0 .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))) (not (= (+ (select .cse7 .cse4) 1) 0))))) .cse8 .cse0) (or .cse8 .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< .cse11 0) (<= c_~n~0 .cse11))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-26 00:08:46,696 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 139 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:08:57,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:09:08,869 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 114 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:09:13,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:09:33,120 WARN L233 SmtUtils]: Spent 11.05s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:09:59,540 WARN L233 SmtUtils]: Spent 13.07s on a formula simplification. DAG size of input: 142 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:10:13,171 WARN L233 SmtUtils]: Spent 8.82s on a formula simplification. DAG size of input: 112 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:10:30,100 WARN L233 SmtUtils]: Spent 15.20s on a formula simplification. DAG size of input: 139 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:10:42,442 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 108 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:11:09,099 WARN L233 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 143 DAG size of output: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:11:19,136 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 133 DAG size of output: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:11:21,125 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse8 (not .cse5)) (.cse0 (<= c_~back~0 c_~front~0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse10 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (or .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1))))) .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (select .cse6 .cse4) 1))))) .cse0 .cse5) (or (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))) (not (= (+ (select .cse7 .cse4) 1) 0))))) .cse8 .cse0) (or .cse8 .cse0 (forall ((v_ArrVal_538 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< .cse11 0) (<= c_~n~0 .cse11))) (<= 1 c_~v_assert~0)) is different from false [2022-11-26 00:11:42,385 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 132 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:11:44,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:11:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:44,784 INFO L93 Difference]: Finished difference Result 3261 states and 7807 transitions. [2022-11-26 00:11:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-11-26 00:11:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-26 00:11:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:44,795 INFO L225 Difference]: With dead ends: 3261 [2022-11-26 00:11:44,795 INFO L226 Difference]: Without dead ends: 2585 [2022-11-26 00:11:44,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 10050 ImplicationChecksByTransitivity, 247.0s TimeCoverageRelationStatistics Valid=4204, Invalid=20444, Unknown=186, NotChecked=2226, Total=27060 [2022-11-26 00:11:44,798 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1752 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 413 mSolverCounterUnsat, 82 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 82 IncrementalHoareTripleChecker+Unknown, 1242 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:44,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 60 Invalid, 3971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 2234 Invalid, 82 Unknown, 1242 Unchecked, 11.5s Time] [2022-11-26 00:11:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2022-11-26 00:11:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 1229. [2022-11-26 00:11:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 2.6449511400651464) internal successors, (3248), 1228 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 3248 transitions. [2022-11-26 00:11:44,849 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 3248 transitions. Word has length 29 [2022-11-26 00:11:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:44,849 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 3248 transitions. [2022-11-26 00:11:44,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.775) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 3248 transitions. [2022-11-26 00:11:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:11:44,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:44,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:44,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:11:45,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 00:11:45,067 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-26 00:11:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 526133233, now seen corresponding path program 10 times [2022-11-26 00:11:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:45,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009884423] [2022-11-26 00:11:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:46,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:46,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009884423] [2022-11-26 00:11:46,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009884423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:11:46,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973701372] [2022-11-26 00:11:46,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:11:46,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:11:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:11:46,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:11:46,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:11:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:46,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-26 00:11:46,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:11:47,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:11:47,567 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 44 treesize of output 42 [2022-11-26 00:11:47,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:47,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2022-11-26 00:11:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:47,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:11:48,013 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-26 00:11:48,543 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:11:48,544 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 286 treesize of output 240 [2022-11-26 00:11:48,568 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 59 treesize of output 52 [2022-11-26 00:11:48,584 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 52 treesize of output 45 [2022-11-26 00:11:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:49,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973701372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:11:49,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314533750] [2022-11-26 00:11:49,849 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-26 00:11:49,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:11:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 37 [2022-11-26 00:11:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130576805] [2022-11-26 00:11:49,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:11:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:11:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:11:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1123, Unknown=11, NotChecked=70, Total=1406 [2022-11-26 00:11:49,852 INFO L87 Difference]: Start difference. First operand 1229 states and 3248 transitions. Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:52,564 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 0 c_~sum~0)) is different from false [2022-11-26 00:11:53,728 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 0 c_~sum~0)) is different from false [2022-11-26 00:11:53,751 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-11-26 00:11:55,135 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-11-26 00:11:59,108 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse4))))) (.cse1 (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse4)) 1)))) (and .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))))) is different from false [2022-11-26 00:11:59,998 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse2)) 1)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-26 00:12:00,121 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_587 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~queue~0.base) .cse2)) 1)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-26 00:12:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:12:03,405 INFO L93 Difference]: Finished difference Result 2251 states and 5783 transitions. [2022-11-26 00:12:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-26 00:12:03,406 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-26 00:12:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:12:03,414 INFO L225 Difference]: With dead ends: 2251 [2022-11-26 00:12:03,414 INFO L226 Difference]: Without dead ends: 2085 [2022-11-26 00:12:03,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1689, Invalid=7986, Unknown=59, NotChecked=1608, Total=11342 [2022-11-26 00:12:03,416 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 663 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 103 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:12:03,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 35 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1364 Invalid, 41 Unknown, 367 Unchecked, 2.3s Time] [2022-11-26 00:12:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2022-11-26 00:12:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1246. [2022-11-26 00:12:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.6497991967871486) internal successors, (3299), 1245 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3299 transitions. [2022-11-26 00:12:03,478 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3299 transitions. Word has length 29 [2022-11-26 00:12:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:12:03,478 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 3299 transitions. [2022-11-26 00:12:03,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3299 transitions. [2022-11-26 00:12:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:12:03,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:12:03,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:12:03,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:12:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:03,688 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-26 00:12:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:12:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1052475641, now seen corresponding path program 11 times [2022-11-26 00:12:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:12:03,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186892257] [2022-11-26 00:12:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:12:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:12:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:12:05,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:12:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186892257] [2022-11-26 00:12:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186892257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:12:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576348515] [2022-11-26 00:12:05,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:12:05,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:05,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:12:05,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:12:05,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:12:05,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:12:05,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:12:05,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-26 00:12:05,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:12:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:06,159 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 44 treesize of output 42 [2022-11-26 00:12:06,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:06,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 14 [2022-11-26 00:12:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:12:06,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:12:07,046 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2022-11-26 00:12:07,477 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-11-26 00:12:07,478 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 292 treesize of output 234 [2022-11-26 00:12:07,493 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 59 treesize of output 52 [2022-11-26 00:12:07,507 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 52 treesize of output 45 [2022-11-26 00:12:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:12:08,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576348515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:12:08,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404351834] [2022-11-26 00:12:08,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-26 00:12:08,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:12:08,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2022-11-26 00:12:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972372716] [2022-11-26 00:12:08,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:12:08,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:12:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:12:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:12:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1039, Unknown=15, NotChecked=68, Total=1332 [2022-11-26 00:12:08,712 INFO L87 Difference]: Start difference. First operand 1246 states and 3299 transitions. Second operand has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 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-26 00:12:10,803 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~front~0 1))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse1))))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (<= c_~back~0 c_~front~0)) (.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) .cse5 (not (= (+ .cse6 1) 0))) (or .cse5 .cse4 (not (= .cse6 1))))) (< .cse7 0) (<= c_~n~0 .cse7)))) is different from false [2022-11-26 00:12:14,823 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2022-11-26 00:12:17,592 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-26 00:12:26,896 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-26 00:12:26,948 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-26 00:12:28,158 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|)) is different from false [2022-11-26 00:12:28,229 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_636 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_636 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-26 00:12:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:12:28,731 INFO L93 Difference]: Finished difference Result 1681 states and 4032 transitions. [2022-11-26 00:12:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-26 00:12:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 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 29 [2022-11-26 00:12:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:12:28,738 INFO L225 Difference]: With dead ends: 1681 [2022-11-26 00:12:28,738 INFO L226 Difference]: Without dead ends: 1482 [2022-11-26 00:12:28,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3185 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1750, Invalid=7923, Unknown=61, NotChecked=1608, Total=11342 [2022-11-26 00:12:28,740 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 983 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 209 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 854 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:12:28,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 57 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1847 Invalid, 29 Unknown, 854 Unchecked, 3.2s Time] [2022-11-26 00:12:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-11-26 00:12:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 804. [2022-11-26 00:12:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 2.539227895392279) internal successors, (2039), 803 states have internal predecessors, (2039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2039 transitions. [2022-11-26 00:12:28,767 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2039 transitions. Word has length 29 [2022-11-26 00:12:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:12:28,767 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 2039 transitions. [2022-11-26 00:12:28,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 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-26 00:12:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2039 transitions. [2022-11-26 00:12:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:12:28,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:12:28,770 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:12:28,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:12:28,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 00:12:28,981 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-26 00:12:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:12:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash 204439476, now seen corresponding path program 12 times [2022-11-26 00:12:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:12:28,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9449592] [2022-11-26 00:12:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:12:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:12:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:12:30,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:12:30,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9449592] [2022-11-26 00:12:30,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9449592] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:12:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017083827] [2022-11-26 00:12:30,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:12:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:12:30,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:12:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:12:30,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:12:30,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:12:30,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:12:30,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:12:31,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:31,188 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 48 treesize of output 14 [2022-11-26 00:12:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:12:31,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:12:31,802 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:12:31,802 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 224 treesize of output 194 [2022-11-26 00:12:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:12:32,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017083827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:12:32,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [958036606] [2022-11-26 00:12:32,456 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-26 00:12:32,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:12:32,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 32 [2022-11-26 00:12:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234006006] [2022-11-26 00:12:32,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:12:32,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 00:12:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:12:32,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 00:12:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:12:32,459 INFO L87 Difference]: Start difference. First operand 804 states and 2039 transitions. Second operand has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:12:38,407 INFO L93 Difference]: Finished difference Result 1799 states and 4495 transitions. [2022-11-26 00:12:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-26 00:12:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-26 00:12:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:12:38,415 INFO L225 Difference]: With dead ends: 1799 [2022-11-26 00:12:38,415 INFO L226 Difference]: Without dead ends: 1751 [2022-11-26 00:12:38,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1128, Invalid=7062, Unknown=0, NotChecked=0, Total=8190 [2022-11-26 00:12:38,417 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 507 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:12:38,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 40 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 00:12:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2022-11-26 00:12:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 982. [2022-11-26 00:12:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 2.561671763506626) internal successors, (2513), 981 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2513 transitions. [2022-11-26 00:12:38,452 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2513 transitions. Word has length 30 [2022-11-26 00:12:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:12:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 2513 transitions. [2022-11-26 00:12:38,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:12:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2513 transitions. [2022-11-26 00:12:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:12:38,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:12:38,456 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:12:38,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:12:38,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 00:12:38,662 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-26 00:12:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:12:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1839524266, now seen corresponding path program 13 times [2022-11-26 00:12:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:12:38,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715721842] [2022-11-26 00:12:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:12:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:12:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:12:41,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:12:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715721842] [2022-11-26 00:12:41,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715721842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:12:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373902857] [2022-11-26 00:12:41,859 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:12:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:12:41,861 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:12:41,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:12:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:42,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:12:42,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:12:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:42,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:12:42,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:42,731 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 48 treesize of output 14 [2022-11-26 00:12:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:12:42,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:12:43,419 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse0 (not .cse6)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (or .cse0 (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~queue~0.base))) (or (not (= (+ (select .cse1 .cse2) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse1 .cse3) (select .cse1 .cse4))))))) (or (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~queue~0.base))) (or (not (= (select .cse5 .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))) .cse6) (or (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4)) 1) (not (= (+ (select .cse7 .cse2) 1) 0))))) .cse0) (or (forall ((v_ArrVal_741 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_741) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4)) 1) (not (= (select .cse8 .cse2) 1))))) .cse6)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-26 00:12:43,601 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:12:43,602 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 504 treesize of output 424 [2022-11-26 00:12:43,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:43,636 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 267 treesize of output 275 [2022-11-26 00:12:43,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:43,692 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 248 treesize of output 256 [2022-11-26 00:12:43,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:43,738 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 229 treesize of output 237 [2022-11-26 00:12:43,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:43,787 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 210 treesize of output 218 [2022-11-26 00:12:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-11-26 00:12:47,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373902857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:12:47,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56900076] [2022-11-26 00:12:47,473 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-26 00:12:47,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:12:47,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2022-11-26 00:12:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861692029] [2022-11-26 00:12:47,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:12:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:12:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:12:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:12:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1184, Unknown=1, NotChecked=70, Total=1406 [2022-11-26 00:12:47,476 INFO L87 Difference]: Start difference. First operand 982 states and 2513 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:13:17,558 WARN L233 SmtUtils]: Spent 18.40s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:13:33,923 WARN L233 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:13:53,033 WARN L233 SmtUtils]: Spent 18.37s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:14:09,662 WARN L233 SmtUtils]: Spent 16.36s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:14:26,360 WARN L233 SmtUtils]: Spent 16.29s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:14:46,829 WARN L233 SmtUtils]: Spent 20.36s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:14:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:14:47,271 INFO L93 Difference]: Finished difference Result 2061 states and 5149 transitions. [2022-11-26 00:14:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-26 00:14:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-26 00:14:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:14:47,277 INFO L225 Difference]: With dead ends: 2061 [2022-11-26 00:14:47,277 INFO L226 Difference]: Without dead ends: 2013 [2022-11-26 00:14:47,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 3350 ImplicationChecksByTransitivity, 119.1s TimeCoverageRelationStatistics Valid=1346, Invalid=9787, Unknown=1, NotChecked=208, Total=11342 [2022-11-26 00:14:47,279 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 687 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 54 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:14:47,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 51 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2022 Invalid, 3 Unknown, 102 Unchecked, 2.4s Time] [2022-11-26 00:14:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-11-26 00:14:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 996. [2022-11-26 00:14:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 2.563819095477387) internal successors, (2551), 995 states have internal predecessors, (2551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:14:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2551 transitions. [2022-11-26 00:14:47,315 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 2551 transitions. Word has length 30 [2022-11-26 00:14:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:14:47,315 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 2551 transitions. [2022-11-26 00:14:47,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:14:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2551 transitions. [2022-11-26 00:14:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:14:47,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:14:47,318 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:14:47,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:14:47,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 00:14:47,524 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-26 00:14:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:14:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1030826602, now seen corresponding path program 14 times [2022-11-26 00:14:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:14:47,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310691865] [2022-11-26 00:14:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:14:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:14:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:14:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:14:50,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:14:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310691865] [2022-11-26 00:14:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310691865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:14:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655222593] [2022-11-26 00:14:50,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:14:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:14:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:14:50,475 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:14:50,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 00:14:50,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:14:50,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:14:50,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-26 00:14:50,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:14:50,922 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 25 treesize of output 7 [2022-11-26 00:14:51,076 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 27 treesize of output 11 [2022-11-26 00:14:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:14:51,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:14:51,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:14:51,389 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 68 treesize of output 48 [2022-11-26 00:14:51,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:14:51,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 172 [2022-11-26 00:14:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:14:52,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655222593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:14:52,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750231347] [2022-11-26 00:14:52,179 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-26 00:14:52,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:14:52,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-11-26 00:14:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289958896] [2022-11-26 00:14:52,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:14:52,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:14:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:14:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:14:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:14:52,181 INFO L87 Difference]: Start difference. First operand 996 states and 2551 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:15:03,880 INFO L93 Difference]: Finished difference Result 2784 states and 7029 transitions. [2022-11-26 00:15:03,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-26 00:15:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-26 00:15:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:15:03,885 INFO L225 Difference]: With dead ends: 2784 [2022-11-26 00:15:03,885 INFO L226 Difference]: Without dead ends: 2410 [2022-11-26 00:15:03,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4473 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1691, Invalid=12115, Unknown=0, NotChecked=0, Total=13806 [2022-11-26 00:15:03,887 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 631 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:15:03,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 16 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-26 00:15:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-11-26 00:15:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 1221. [2022-11-26 00:15:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 2.5778688524590163) internal successors, (3145), 1220 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 3145 transitions. [2022-11-26 00:15:03,927 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 3145 transitions. Word has length 30 [2022-11-26 00:15:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:15:03,927 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 3145 transitions. [2022-11-26 00:15:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 3145 transitions. [2022-11-26 00:15:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:15:03,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:15:03,930 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:15:03,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:15:04,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:15:04,137 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-26 00:15:04,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:15:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1395195386, now seen corresponding path program 15 times [2022-11-26 00:15:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:15:04,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173626619] [2022-11-26 00:15:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:15:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:15:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:15:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:15:05,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:15:05,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173626619] [2022-11-26 00:15:05,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173626619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:15:05,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124165870] [2022-11-26 00:15:05,886 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:15:05,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:15:05,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:15:05,887 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:15:05,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 00:15:06,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:15:06,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:15:06,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:15:06,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:15:06,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:15:06,527 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 44 treesize of output 42 [2022-11-26 00:15:06,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:15:06,594 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 48 treesize of output 14 [2022-11-26 00:15:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:15:06,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:15:06,921 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_846 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-26 00:15:07,391 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:15:07,391 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 286 treesize of output 240 [2022-11-26 00:15:07,404 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 59 treesize of output 52 [2022-11-26 00:15:07,417 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 52 treesize of output 45 [2022-11-26 00:15:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-11-26 00:15:08,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124165870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:15:08,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [221133508] [2022-11-26 00:15:08,166 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-26 00:15:08,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:15:08,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 36 [2022-11-26 00:15:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264508319] [2022-11-26 00:15:08,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:15:08,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:15:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:15:08,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:15:08,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1107, Unknown=6, NotChecked=68, Total=1332 [2022-11-26 00:15:08,169 INFO L87 Difference]: Start difference. First operand 1221 states and 3145 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:15,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4))))) (.cse3 (forall ((v_ArrVal_846 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4)) 1)))) (and .cse0 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (and .cse0 .cse3)) (<= 0 c_~sum~0) (<= c_~sum~0 1) .cse3))) is different from false [2022-11-26 00:15:17,308 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4))))) (.cse3 (forall ((v_ArrVal_846 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4)) 1)))) (and .cse0 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (and .cse0 .cse3)) .cse3))) is different from false [2022-11-26 00:15:18,457 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_846 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_846 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_846) c_~queue~0.base) .cse4)) 1))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-26 00:15:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:15:18,856 INFO L93 Difference]: Finished difference Result 3287 states and 8500 transitions. [2022-11-26 00:15:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-26 00:15:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-26 00:15:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:15:18,862 INFO L225 Difference]: With dead ends: 3287 [2022-11-26 00:15:18,862 INFO L226 Difference]: Without dead ends: 2939 [2022-11-26 00:15:18,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1477, Invalid=7598, Unknown=61, NotChecked=764, Total=9900 [2022-11-26 00:15:18,863 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 564 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 62 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:15:18,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 32 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1413 Invalid, 64 Unknown, 261 Unchecked, 2.2s Time] [2022-11-26 00:15:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2022-11-26 00:15:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1260. [2022-11-26 00:15:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1259 states have (on average 2.563939634630659) internal successors, (3228), 1259 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 3228 transitions. [2022-11-26 00:15:18,911 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 3228 transitions. Word has length 30 [2022-11-26 00:15:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:15:18,911 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 3228 transitions. [2022-11-26 00:15:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 3228 transitions. [2022-11-26 00:15:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:15:18,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:15:18,915 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:15:18,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:15:19,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:15:19,121 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-26 00:15:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:15:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1651188190, now seen corresponding path program 16 times [2022-11-26 00:15:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:15:19,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960590881] [2022-11-26 00:15:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:15:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:15:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:15:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:15:21,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:15:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960590881] [2022-11-26 00:15:21,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960590881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:15:21,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677192217] [2022-11-26 00:15:21,001 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:15:21,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:15:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:15:21,003 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:15:21,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 00:15:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:15:21,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:15:21,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:15:21,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:15:21,531 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 32 treesize of output 32 [2022-11-26 00:15:21,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:15:21,655 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 48 treesize of output 14 [2022-11-26 00:15:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:15:21,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:15:22,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) 1)) (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2)))))))) is different from false [2022-11-26 00:15:22,305 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:15:22,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 252 [2022-11-26 00:15:22,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:15:22,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 58 [2022-11-26 00:15:22,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:15:22,344 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 58 treesize of output 45 [2022-11-26 00:15:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:15:23,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677192217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:15:23,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [192877347] [2022-11-26 00:15:23,082 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-26 00:15:23,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:15:23,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2022-11-26 00:15:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648323108] [2022-11-26 00:15:23,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:15:23,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:15:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:15:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:15:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1114, Unknown=1, NotChecked=68, Total=1332 [2022-11-26 00:15:23,084 INFO L87 Difference]: Start difference. First operand 1260 states and 3228 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:26,936 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) .cse1 (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)) (<= c_~sum~0 1))))) is different from false [2022-11-26 00:15:27,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) .cse1 (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)))))) is different from false [2022-11-26 00:15:27,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) .cse1 (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)))))) is different from false [2022-11-26 00:15:27,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)))))) is different from false [2022-11-26 00:15:27,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_899 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_899 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_899) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)))))) is different from false [2022-11-26 00:15:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:15:29,132 INFO L93 Difference]: Finished difference Result 2503 states and 6538 transitions. [2022-11-26 00:15:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-26 00:15:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-26 00:15:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:15:29,138 INFO L225 Difference]: With dead ends: 2503 [2022-11-26 00:15:29,139 INFO L226 Difference]: Without dead ends: 2409 [2022-11-26 00:15:29,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1070, Invalid=6430, Unknown=6, NotChecked=1050, Total=8556 [2022-11-26 00:15:29,140 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 507 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 36 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:15:29,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 42 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2178 Invalid, 5 Unknown, 464 Unchecked, 2.2s Time] [2022-11-26 00:15:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2022-11-26 00:15:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 1112. [2022-11-26 00:15:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 2.547254725472547) internal successors, (2830), 1111 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2830 transitions. [2022-11-26 00:15:29,177 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2830 transitions. Word has length 30 [2022-11-26 00:15:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:15:29,177 INFO L495 AbstractCegarLoop]: Abstraction has 1112 states and 2830 transitions. [2022-11-26 00:15:29,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:15:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2830 transitions. [2022-11-26 00:15:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:15:29,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:15:29,180 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:15:29,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-26 00:15:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-26 00:15:29,386 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-26 00:15:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:15:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -231333292, now seen corresponding path program 17 times [2022-11-26 00:15:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:15:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796496868] [2022-11-26 00:15:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:15:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:15:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:15:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:15:31,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:15:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796496868] [2022-11-26 00:15:31,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796496868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:15:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780263782] [2022-11-26 00:15:31,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:15:31,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:15:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:15:31,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:15:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b0d47fd-9673-438e-9574-4b83f1db00bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 00:15:31,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:15:31,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:15:31,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-26 00:15:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:15:32,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:15:32,279 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 44 treesize of output 42 [2022-11-26 00:15:32,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:15:32,361 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 48 treesize of output 14 [2022-11-26 00:15:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:15:32,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:15:32,809 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-26 00:15:32,824 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse0)) 1)))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-26 00:15:32,840 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse1)) 1)))))) is different from false [2022-11-26 00:15:32,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_952 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_952 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_952) c_~queue~0.base) .cse4)) 1))))))) is different from false [2022-11-26 00:15:33,022 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-26 00:15:33,023 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 286 treesize of output 240 [2022-11-26 00:15:33,035 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 59 treesize of output 52 [2022-11-26 00:15:33,051 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 52 treesize of output 45 [2022-11-26 00:15:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2022-11-26 00:15:33,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780263782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:15:33,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303750803] [2022-11-26 00:15:33,637 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-26 00:15:33,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:15:33,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 39 [2022-11-26 00:15:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458781205] [2022-11-26 00:15:33,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:15:33,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-26 00:15:33,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:15:33,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-26 00:15:33,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1088, Unknown=4, NotChecked=284, Total=1560 [2022-11-26 00:15:33,639 INFO L87 Difference]: Start difference. First operand 1112 states and 2830 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)