./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --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_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/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_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/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_8212fb2f-e13d-4aaf-939c-6776aea069cd/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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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:54:27,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:54:27,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:54:27,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:54:27,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:54:27,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:54:27,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:54:27,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:54:27,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:54:27,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:54:27,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:54:27,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:54:27,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:54:27,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:54:27,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:54:27,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:54:27,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:54:27,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:54:27,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:54:27,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:54:27,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:54:27,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:54:27,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:54:27,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:54:27,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:54:27,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:54:27,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:54:27,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:54:27,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:54:27,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:54:27,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:54:27,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:54:27,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:54:27,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:54:27,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:54:27,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:54:27,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:54:27,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:54:27,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:54:27,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:54:27,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:54:27,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:54:27,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:54:27,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:54:27,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:54:27,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:54:27,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:54:27,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:54:27,176 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:54:27,176 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:54:27,177 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:54:27,177 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:54:27,178 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:54:27,178 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:54:27,178 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:54:27,179 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:54:27,179 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:54:27,179 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:54:27,179 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:54:27,180 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:54:27,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:54:27,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:54:27,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:54:27,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:54:27,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:54:27,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:54:27,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:54:27,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:54:27,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:54:27,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:54:27,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:54:27,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:54:27,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:54:27,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:54:27,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:54:27,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:54:27,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:54:27,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:54:27,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:54:27,185 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:54:27,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:54:27,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:54:27,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:54:27,185 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_8212fb2f-e13d-4aaf-939c-6776aea069cd/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_8212fb2f-e13d-4aaf-939c-6776aea069cd/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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-26 00:54:27,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:54:27,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:54:27,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:54:27,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:54:27,524 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:54:27,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-26 00:54:30,519 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:54:30,898 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:54:30,900 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/sv-benchmarks/c/pthread/queue_ok.i [2022-11-26 00:54:30,926 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/data/07c914b80/218504539c734b66afc436e80f781a79/FLAG750f29017 [2022-11-26 00:54:30,944 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/data/07c914b80/218504539c734b66afc436e80f781a79 [2022-11-26 00:54:30,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:54:30,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:54:30,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:54:30,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:54:30,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:54:30,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:54:30" (1/1) ... [2022-11-26 00:54:30,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10369a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:30, skipping insertion in model container [2022-11-26 00:54:30,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:54:30" (1/1) ... [2022-11-26 00:54:30,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:54:31,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:54:31,506 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_8212fb2f-e13d-4aaf-939c-6776aea069cd/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-26 00:54:31,513 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_8212fb2f-e13d-4aaf-939c-6776aea069cd/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-26 00:54:31,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:54:31,530 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:54:31,581 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_8212fb2f-e13d-4aaf-939c-6776aea069cd/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-26 00:54:31,605 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_8212fb2f-e13d-4aaf-939c-6776aea069cd/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-26 00:54:31,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:54:31,664 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:54:31,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31 WrapperNode [2022-11-26 00:54:31,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:54:31,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:54:31,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:54:31,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:54:31,674 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:54:31" (1/1) ... [2022-11-26 00:54:31,699 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:54:31" (1/1) ... [2022-11-26 00:54:31,753 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-26 00:54:31,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:54:31,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:54:31,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:54:31,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:54:31,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:54:31,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:54:31,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:54:31,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:54:31,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (1/1) ... [2022-11-26 00:54:31,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:54:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:31,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:54:31,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:54:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-26 00:54:31,872 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-26 00:54:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-26 00:54:31,872 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-26 00:54:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:54:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:54:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:54:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:54:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-26 00:54:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:54:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:54:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:54:31,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:54:31,875 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:54:32,022 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:54:32,025 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:54:32,555 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:54:32,565 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:54:32,565 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 00:54:32,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:54:32 BoogieIcfgContainer [2022-11-26 00:54:32,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:54:32,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:54:32,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:54:32,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:54:32,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:54:30" (1/3) ... [2022-11-26 00:54:32,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7bc1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:54:32, skipping insertion in model container [2022-11-26 00:54:32,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:54:31" (2/3) ... [2022-11-26 00:54:32,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7bc1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:54:32, skipping insertion in model container [2022-11-26 00:54:32,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:54:32" (3/3) ... [2022-11-26 00:54:32,577 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-26 00:54:32,585 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:54:32,592 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:54:32,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-26 00:54:32,593 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:54:32,702 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-26 00:54:32,740 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:54:32,754 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-26 00:54:32,758 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-26 00:54:32,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-26 00:54:32,907 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-26 00:54:32,907 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 00:54:32,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-26 00:54:32,925 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-26 00:54:42,680 INFO L134 LiptonReduction]: Checked pairs total: 21650 [2022-11-26 00:54:42,682 INFO L136 LiptonReduction]: Total number of compositions: 215 [2022-11-26 00:54:42,691 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2022-11-26 00:54:42,749 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states 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:54:42,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:54:42,775 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;@3238cffd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:54:42,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-26 00:54:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states 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:54:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-26 00:54:42,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:42,785 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-26 00:54:42,786 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 2 more)] === [2022-11-26 00:54:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times [2022-11-26 00:54:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224813899] [2022-11-26 00:54:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:42,898 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:54:42,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:42,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224813899] [2022-11-26 00:54:42,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224813899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:42,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:42,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-26 00:54:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764333924] [2022-11-26 00:54:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:54:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:54:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:54:42,936 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states 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:54:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:43,057 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2022-11-26 00:54:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:54:43,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-26 00:54:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:43,084 INFO L225 Difference]: With dead ends: 510 [2022-11-26 00:54:43,089 INFO L226 Difference]: Without dead ends: 510 [2022-11-26 00:54:43,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:54:43,095 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:43,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:54:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-26 00:54:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-26 00:54:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states 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:54:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2022-11-26 00:54:43,202 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2022-11-26 00:54:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:43,202 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2022-11-26 00:54:43,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states 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:54:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2022-11-26 00:54:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:54:43,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:43,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:54:43,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1171630367, now seen corresponding path program 1 times [2022-11-26 00:54:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:43,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80654454] [2022-11-26 00:54:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:43,558 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:54:43,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80654454] [2022-11-26 00:54:43,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80654454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:43,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:43,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:54:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362048118] [2022-11-26 00:54:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:43,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:54:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:54:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:54:43,561 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:43,668 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2022-11-26 00:54:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:54:43,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-26 00:54:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:43,673 INFO L225 Difference]: With dead ends: 220 [2022-11-26 00:54:43,674 INFO L226 Difference]: Without dead ends: 198 [2022-11-26 00:54:43,674 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:54:43,676 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:43,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:54:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-26 00:54:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-26 00:54:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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:54:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2022-11-26 00:54:43,700 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2022-11-26 00:54:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:43,701 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2022-11-26 00:54:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2022-11-26 00:54:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:54:43,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:43,705 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:54:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:54:43,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2092899768, now seen corresponding path program 1 times [2022-11-26 00:54:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:43,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196032798] [2022-11-26 00:54:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:43,782 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:54:43,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:43,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196032798] [2022-11-26 00:54:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196032798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:43,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:43,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:54:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28585406] [2022-11-26 00:54:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:54:43,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:54:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:54:43,786 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) 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:54:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:43,871 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2022-11-26 00:54:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:54:43,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) 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:54:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:43,873 INFO L225 Difference]: With dead ends: 258 [2022-11-26 00:54:43,874 INFO L226 Difference]: Without dead ends: 258 [2022-11-26 00:54:43,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:54:43,875 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:43,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:54:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-26 00:54:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2022-11-26 00:54:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1970443349753697) internal successors, (446), 203 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:54:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2022-11-26 00:54:43,885 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2022-11-26 00:54:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:43,885 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2022-11-26 00:54:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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:54:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2022-11-26 00:54:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:54:43,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:43,887 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, 1, 1] [2022-11-26 00:54:43,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:54:43,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -985514399, now seen corresponding path program 1 times [2022-11-26 00:54:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:43,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276078646] [2022-11-26 00:54:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:43,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276078646] [2022-11-26 00:54:43,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276078646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653558303] [2022-11-26 00:54:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:43,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:43,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:43,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:54:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:44,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:54:44,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:44,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653558303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [755464293] [2022-11-26 00:54:44,296 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:54:44,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-26 00:54:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599505528] [2022-11-26 00:54:44,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:54:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:54:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:54:44,301 INFO L87 Difference]: Start difference. First operand 204 states and 446 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:44,503 INFO L93 Difference]: Finished difference Result 384 states and 824 transitions. [2022-11-26 00:54:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:54:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-26 00:54:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:44,506 INFO L225 Difference]: With dead ends: 384 [2022-11-26 00:54:44,506 INFO L226 Difference]: Without dead ends: 384 [2022-11-26 00:54:44,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:54:44,507 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:44,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 9 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:54:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-26 00:54:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-26 00:54:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.151436031331593) internal successors, (824), 383 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:54:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 824 transitions. [2022-11-26 00:54:44,536 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 824 transitions. Word has length 26 [2022-11-26 00:54:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:44,536 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 824 transitions. [2022-11-26 00:54:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 824 transitions. [2022-11-26 00:54:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 00:54:44,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:44,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:44,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:54:44,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:44,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 953933320, now seen corresponding path program 2 times [2022-11-26 00:54:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83350634] [2022-11-26 00:54:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 00:54:45,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:45,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83350634] [2022-11-26 00:54:45,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83350634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:45,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:45,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:54:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732233476] [2022-11-26 00:54:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:45,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:54:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:54:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:54:45,069 INFO L87 Difference]: Start difference. First operand 384 states and 824 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) 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:54:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:45,155 INFO L93 Difference]: Finished difference Result 272 states and 526 transitions. [2022-11-26 00:54:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:54:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) 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 47 [2022-11-26 00:54:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:45,158 INFO L225 Difference]: With dead ends: 272 [2022-11-26 00:54:45,159 INFO L226 Difference]: Without dead ends: 270 [2022-11-26 00:54:45,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:54:45,160 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:45,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:54:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-26 00:54:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-26 00:54:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:54:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2022-11-26 00:54:45,170 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 47 [2022-11-26 00:54:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:45,170 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2022-11-26 00:54:45,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) 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:54:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2022-11-26 00:54:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 00:54:45,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:45,172 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:45,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:54:45,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2121986374, now seen corresponding path program 1 times [2022-11-26 00:54:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5284087] [2022-11-26 00:54:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:45,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5284087] [2022-11-26 00:54:45,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5284087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887128017] [2022-11-26 00:54:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:45,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:45,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:54:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:45,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:54:45,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:45,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:45,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887128017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371518258] [2022-11-26 00:54:45,745 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:54:45,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-26 00:54:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053744250] [2022-11-26 00:54:45,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:45,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:54:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:54:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:54:45,748 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:54:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:46,064 INFO L93 Difference]: Finished difference Result 510 states and 967 transitions. [2022-11-26 00:54:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:54:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 48 [2022-11-26 00:54:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:46,067 INFO L225 Difference]: With dead ends: 510 [2022-11-26 00:54:46,067 INFO L226 Difference]: Without dead ends: 510 [2022-11-26 00:54:46,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:54:46,068 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:46,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 19 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:54:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-26 00:54:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-26 00:54:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.899803536345776) internal successors, (967), 509 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 967 transitions. [2022-11-26 00:54:46,085 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 967 transitions. Word has length 48 [2022-11-26 00:54:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:46,086 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 967 transitions. [2022-11-26 00:54:46,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:54:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 967 transitions. [2022-11-26 00:54:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-26 00:54:46,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:46,089 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:46,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 00:54:46,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:46,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 626664730, now seen corresponding path program 2 times [2022-11-26 00:54:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968335309] [2022-11-26 00:54:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:46,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968335309] [2022-11-26 00:54:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968335309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86347054] [2022-11-26 00:54:46,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:54:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:46,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:46,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:54:47,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:54:47,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:54:47,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-26 00:54:47,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:48,093 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:54:48,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:48,145 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 16 treesize of output 18 [2022-11-26 00:54:48,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:54:48,275 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:54:48,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:54:48,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:48,336 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 23 treesize of output 22 [2022-11-26 00:54:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-26 00:54:48,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:48,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:54:48,558 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 53 treesize of output 43 [2022-11-26 00:54:48,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:54:48,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 80 [2022-11-26 00:54:48,589 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 55 treesize of output 47 [2022-11-26 00:54:48,620 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 8 treesize of output 4 [2022-11-26 00:54:48,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:54:48,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2022-11-26 00:54:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-26 00:54:48,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86347054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:48,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90435611] [2022-11-26 00:54:48,870 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:54:48,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:48,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-11-26 00:54:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207460408] [2022-11-26 00:54:48,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:48,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 00:54:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:48,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 00:54:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=476, Unknown=1, NotChecked=0, Total=600 [2022-11-26 00:54:48,874 INFO L87 Difference]: Start difference. First operand 510 states and 967 transitions. Second operand has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:54:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:50,920 INFO L93 Difference]: Finished difference Result 978 states and 1809 transitions. [2022-11-26 00:54:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-26 00:54:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 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 90 [2022-11-26 00:54:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:50,926 INFO L225 Difference]: With dead ends: 978 [2022-11-26 00:54:50,926 INFO L226 Difference]: Without dead ends: 978 [2022-11-26 00:54:50,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1175, Invalid=2856, Unknown=1, NotChecked=0, Total=4032 [2022-11-26 00:54:50,929 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1306 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:50,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 16 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:54:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-11-26 00:54:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 777. [2022-11-26 00:54:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.8518041237113403) internal successors, (1437), 776 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states 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:54:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1437 transitions. [2022-11-26 00:54:50,953 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1437 transitions. Word has length 90 [2022-11-26 00:54:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:50,953 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1437 transitions. [2022-11-26 00:54:50,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:54:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1437 transitions. [2022-11-26 00:54:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-26 00:54:50,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:50,956 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:50,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:51,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 00:54:51,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1789955963, now seen corresponding path program 1 times [2022-11-26 00:54:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:51,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453508227] [2022-11-26 00:54:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:51,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453508227] [2022-11-26 00:54:51,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453508227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35573571] [2022-11-26 00:54:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:51,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:51,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:51,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:51,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:54:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:51,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:54:51,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:52,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:54:52,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35573571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [556021701] [2022-11-26 00:54:52,460 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:54:52,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:52,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2022-11-26 00:54:52,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178665739] [2022-11-26 00:54:52,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:52,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:54:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:54:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:54:52,465 INFO L87 Difference]: Start difference. First operand 777 states and 1437 transitions. Second operand has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:54:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:52,958 INFO L93 Difference]: Finished difference Result 1344 states and 2463 transitions. [2022-11-26 00:54:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:54:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 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 102 [2022-11-26 00:54:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:52,964 INFO L225 Difference]: With dead ends: 1344 [2022-11-26 00:54:52,964 INFO L226 Difference]: Without dead ends: 1344 [2022-11-26 00:54:52,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:54:52,965 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 238 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:52,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 27 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:54:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-11-26 00:54:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2022-11-26 00:54:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.8339538346984363) internal successors, (2463), 1343 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states 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:54:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2463 transitions. [2022-11-26 00:54:53,004 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2463 transitions. Word has length 102 [2022-11-26 00:54:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:53,005 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 2463 transitions. [2022-11-26 00:54:53,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:54:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2463 transitions. [2022-11-26 00:54:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-26 00:54:53,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:53,009 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:53,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:53,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:53,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:54:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 472581100, now seen corresponding path program 2 times [2022-11-26 00:54:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:53,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115431607] [2022-11-26 00:54:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 472 proven. 44 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2022-11-26 00:54:57,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:57,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115431607] [2022-11-26 00:54:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115431607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:57,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012635336] [2022-11-26 00:54:57,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:54:57,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:57,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:57,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:54:58,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:54:58,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:54:58,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-26 00:54:58,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:58,805 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:54:58,806 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 15 treesize of output 15 [2022-11-26 00:55:00,020 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:55:00,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:00,065 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 16 treesize of output 18 [2022-11-26 00:55:00,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:00,165 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:00,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:00,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:00,254 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 23 treesize of output 22 [2022-11-26 00:55:00,280 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 16 treesize of output 18 [2022-11-26 00:55:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 126 proven. 95 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2022-11-26 00:55:00,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:00,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1255) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-11-26 00:55:00,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1253 Int) (v_ArrVal_1255 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1253)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1255) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-11-26 00:55:00,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| Int) (v_ArrVal_1253 Int) (v_ArrVal_1252 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1250))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| 4)) v_ArrVal_1252) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1253)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1255) |c_~#queue~0.base|) .cse1) 20))))) is different from false [2022-11-26 00:55:00,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:00,523 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 79 treesize of output 59 [2022-11-26 00:55:00,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:00,537 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 112 treesize of output 114 [2022-11-26 00:55:00,549 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 72 treesize of output 64 [2022-11-26 00:55:00,558 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 78 treesize of output 70 [2022-11-26 00:55:00,578 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 8 treesize of output 4 [2022-11-26 00:55:00,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:00,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 53 treesize of output 49 [2022-11-26 00:55:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 118 proven. 57 refuted. 0 times theorem prover too weak. 974 trivial. 46 not checked. [2022-11-26 00:55:01,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012635336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:55:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98194041] [2022-11-26 00:55:01,283 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:55:01,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:55:01,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 28 [2022-11-26 00:55:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944536805] [2022-11-26 00:55:01,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:55:01,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:55:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:55:01,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:55:01,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=546, Unknown=4, NotChecked=150, Total=812 [2022-11-26 00:55:01,287 INFO L87 Difference]: Start difference. First operand 1344 states and 2463 transitions. Second operand has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:55:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:02,602 INFO L93 Difference]: Finished difference Result 2450 states and 4406 transitions. [2022-11-26 00:55:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:55:02,603 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 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 170 [2022-11-26 00:55:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:02,612 INFO L225 Difference]: With dead ends: 2450 [2022-11-26 00:55:02,612 INFO L226 Difference]: Without dead ends: 2450 [2022-11-26 00:55:02,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 330 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=858, Unknown=4, NotChecked=198, Total=1332 [2022-11-26 00:55:02,614 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 526 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:02,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 24 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 497 Invalid, 0 Unknown, 231 Unchecked, 0.6s Time] [2022-11-26 00:55:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-11-26 00:55:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 1826. [2022-11-26 00:55:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 1.815890410958904) internal successors, (3314), 1825 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states 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:55:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 3314 transitions. [2022-11-26 00:55:02,678 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 3314 transitions. Word has length 170 [2022-11-26 00:55:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:02,679 INFO L495 AbstractCegarLoop]: Abstraction has 1826 states and 3314 transitions. [2022-11-26 00:55:02,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.206896551724138) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:55:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3314 transitions. [2022-11-26 00:55:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-26 00:55:02,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:02,684 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 13, 13, 13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:55:02,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:55:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:02,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:55:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2088485990, now seen corresponding path program 3 times [2022-11-26 00:55:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:02,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385052710] [2022-11-26 00:55:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 822 proven. 99 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-26 00:55:09,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385052710] [2022-11-26 00:55:09,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385052710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687264413] [2022-11-26 00:55:09,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:55:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:09,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:09,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:55:14,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:55:14,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:55:14,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-26 00:55:14,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:15,248 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:55:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:15,290 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 16 treesize of output 18 [2022-11-26 00:55:15,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:15,406 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:15,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:15,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:15,482 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 23 treesize of output 22 [2022-11-26 00:55:15,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-26 00:55:15,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:15,629 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 16 treesize of output 18 [2022-11-26 00:55:15,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:15,755 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:15,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:15,870 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 23 treesize of output 22 [2022-11-26 00:55:15,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-26 00:55:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:16,044 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 16 treesize of output 18 [2022-11-26 00:55:16,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:16,144 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-26 00:55:16,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:16,199 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 23 treesize of output 22 [2022-11-26 00:55:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 482 proven. 59 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2022-11-26 00:55:16,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:16,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1669 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1)))))) is different from false [2022-11-26 00:55:16,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1669 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1)))))) is different from false [2022-11-26 00:55:16,404 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1669 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1)))))) is different from false [2022-11-26 00:55:16,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1663 Int) (v_ArrVal_1669 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1663) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1) 20))))) is different from false [2022-11-26 00:55:16,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1661 Int) (v_ArrVal_1663 Int) (v_ArrVal_1669 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1661)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1663) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1)))))) is different from false [2022-11-26 00:55:16,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1661 Int) (v_ArrVal_1663 Int) (v_ArrVal_1660 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| Int) (v_ArrVal_1657 Int) (v_ArrVal_1669 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1657) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1660))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| 4) |c_~#queue~0.offset|) v_ArrVal_1661))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1663) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1) 20))))))) is different from false [2022-11-26 00:55:16,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1661 Int) (v_ArrVal_1663 Int) (v_ArrVal_1660 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| Int) (v_ArrVal_1654 Int) (v_ArrVal_1657 Int) (v_ArrVal_1669 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1654)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1657) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1660))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| 4) |c_~#queue~0.offset|) v_ArrVal_1661))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1663) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1669) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_204| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1)))))))) is different from false [2022-11-26 00:55:19,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:19,337 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 694 treesize of output 484 [2022-11-26 00:55:19,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:19,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 793 treesize of output 783 [2022-11-26 00:55:19,376 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 776 treesize of output 760 [2022-11-26 00:55:19,395 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 693 treesize of output 661 [2022-11-26 00:55:19,414 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 774 treesize of output 750 [2022-11-26 00:55:19,453 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 8 treesize of output 4 [2022-11-26 00:55:19,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:19,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 186 [2022-11-26 00:55:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 494 proven. 15 refuted. 0 times theorem prover too weak. 706 trivial. 31 not checked. [2022-11-26 00:55:19,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687264413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:55:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514066873] [2022-11-26 00:55:19,958 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:55:19,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:55:19,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2022-11-26 00:55:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018512404] [2022-11-26 00:55:19,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:55:19,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 00:55:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:55:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 00:55:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1747, Unknown=25, NotChecked=686, Total=2970 [2022-11-26 00:55:19,962 INFO L87 Difference]: Start difference. First operand 1826 states and 3314 transitions. Second operand has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:55:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:29,142 INFO L93 Difference]: Finished difference Result 4673 states and 8271 transitions. [2022-11-26 00:55:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-26 00:55:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 0 states have call successors, (0), 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 173 [2022-11-26 00:55:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:29,160 INFO L225 Difference]: With dead ends: 4673 [2022-11-26 00:55:29,160 INFO L226 Difference]: Without dead ends: 4673 [2022-11-26 00:55:29,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 321 SyntacticMatches, 49 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1590, Invalid=6245, Unknown=25, NotChecked=1260, Total=9120 [2022-11-26 00:55:29,164 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 784 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1190 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:29,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 56 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2127 Invalid, 0 Unknown, 1190 Unchecked, 2.8s Time] [2022-11-26 00:55:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2022-11-26 00:55:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 3526. [2022-11-26 00:55:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.7912056737588653) internal successors, (6314), 3525 states have internal predecessors, (6314), 0 states have call successors, (0), 0 states 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:55:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 6314 transitions. [2022-11-26 00:55:29,264 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 6314 transitions. Word has length 173 [2022-11-26 00:55:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:29,264 INFO L495 AbstractCegarLoop]: Abstraction has 3526 states and 6314 transitions. [2022-11-26 00:55:29,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:55:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 6314 transitions. [2022-11-26 00:55:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-26 00:55:29,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:29,274 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 16, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:55:29,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:55:29,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:29,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:55:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -532185350, now seen corresponding path program 4 times [2022-11-26 00:55:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:29,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221835603] [2022-11-26 00:55:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 884 proven. 174 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-11-26 00:55:40,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:40,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221835603] [2022-11-26 00:55:40,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221835603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:40,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202266155] [2022-11-26 00:55:40,462 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:55:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:40,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:40,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:55:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:41,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 155 conjunts are in the unsatisfiable core [2022-11-26 00:55:41,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:41,442 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:55:41,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:41,492 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 16 treesize of output 18 [2022-11-26 00:55:41,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:41,590 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:41,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:41,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:41,670 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 23 treesize of output 22 [2022-11-26 00:55:41,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-11-26 00:55:41,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:41,814 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 16 treesize of output 18 [2022-11-26 00:55:41,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:41,914 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:41,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,000 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 23 treesize of output 22 [2022-11-26 00:55:42,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-11-26 00:55:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,150 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 16 treesize of output 18 [2022-11-26 00:55:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:42,249 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:42,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:42,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,319 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 23 treesize of output 22 [2022-11-26 00:55:42,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-11-26 00:55:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,470 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 16 treesize of output 18 [2022-11-26 00:55:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:42,562 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:42,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:42,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,644 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 23 treesize of output 22 [2022-11-26 00:55:42,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-11-26 00:55:42,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,797 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 16 treesize of output 18 [2022-11-26 00:55:42,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:42,886 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 00:55:42,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 00:55:42,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:42,973 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 23 treesize of output 22 [2022-11-26 00:55:43,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-26 00:55:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:43,130 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 16 treesize of output 18 [2022-11-26 00:55:43,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:55:43,230 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-26 00:55:43,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-26 00:55:43,298 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 23 treesize of output 22 [2022-11-26 00:55:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 923 proven. 135 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-11-26 00:55:43,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:43,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1)) 20))) is different from false [2022-11-26 00:55:43,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1))))) is different from false [2022-11-26 00:55:43,602 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2099 Int) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2099) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1)) 20))) (= .cse4 20)))) is different from false [2022-11-26 00:55:43,628 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2098 Int) (v_ArrVal_2099 Int) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2098)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2099) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2105)) .cse2)) 20)))))) is different from false [2022-11-26 00:55:44,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2099 Int) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int) (v_ArrVal_2096 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2095) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse2 .cse3))) (= 20 .cse4) (not (= 20 (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2099) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_2105)) .cse3)))))))))) is different from false [2022-11-26 00:55:44,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2099 Int) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2105 Int) (v_ArrVal_2092 Int) (v_ArrVal_2096 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2095) (= .cse2 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse4))) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2099) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse4) 20))))))))) is different from false [2022-11-26 00:55:54,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2105 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (= 20 .cse2) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2099) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse7 .cse1))) (not (<= v_ArrVal_2088 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2095)))))))))) is different from false [2022-11-26 00:56:11,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2105 Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2088) (= .cse3 20) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2099) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse9 .cse1))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2095))))))))))))) is different from false [2022-11-26 00:56:11,758 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2105 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2099) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2105)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse7 .cse1))) (not (<= v_ArrVal_2080 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (= 20 .cse5) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2095) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2088) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse10 .cse1))))))))))))))) is different from false [2022-11-26 00:56:11,837 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2105 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2099) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2105)) .cse1) 20)) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2080) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse9 .cse1))) (= 20 .cse5) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2095) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2088) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse12 .cse1)))))))))))))))) is different from false [2022-11-26 00:56:23,168 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2073 Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2077 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2105 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2077)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2079) .cse1 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse4 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse6 (store (store .cse14 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse9 (select .cse7 .cse1)) (.cse2 (select .cse13 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse0 .cse1))) (= 20 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2095) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2099) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1) 20)) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2088) (= .cse9 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse11 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse1))) (not (<= v_ArrVal_2073 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (< (+ .cse2 1) v_ArrVal_2080)))))))))))))))) is different from false [2022-11-26 00:56:23,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2073 Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2077 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2105 Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075))) (let ((.cse0 (select .cse18 |c_~#queue~0.base|))) (let ((.cse15 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2077)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_2079) .cse1 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse11 (select .cse17 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse4 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse6 (store (store .cse16 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse9 (select .cse7 .cse1)) (.cse2 (select .cse15 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse0 .cse1))) (= 20 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2095) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2099) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1) 20)) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2088) (= .cse9 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse11 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse1))) (< (+ (select .cse13 .cse14) 1) v_ArrVal_2073) (< (+ .cse2 1) v_ArrVal_2080))))))))))))))))) is different from false [2022-11-26 00:56:23,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2092 Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2071 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2073 Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2077 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2105 Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071) .cse14 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075))) (let ((.cse2 (select .cse18 |c_~#queue~0.base|))) (let ((.cse15 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2077)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse11 v_ArrVal_2079) .cse3 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse7 (select .cse17 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2086) .cse3 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse9 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_2092) .cse3 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse1 (select .cse15 .cse3)) (.cse0 (select .cse10 .cse3))) (or (= .cse0 20) (< (+ .cse1 1) v_ArrVal_2080) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2088) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse7 .cse3))) (= .cse1 20) (not (= (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2099) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse3) 20)) (< (+ (select .cse12 .cse3) 1) v_ArrVal_2095) (< (+ (select .cse13 .cse14) 1) v_ArrVal_2073))))))))))))))))) is different from false [2022-11-26 00:56:23,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2070 Int) (v_ArrVal_2092 Int) (v_ArrVal_2071 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2073 Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (v_ArrVal_2105 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2070)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071) .cse7 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse15 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2077)) (.cse14 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse14 v_ArrVal_2079) .cse2 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse4 (select .cse17 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse1 .cse14 v_ArrVal_2086) .cse2 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse12 (store (store .cse16 |c_~#queue~0.base| (store (store .cse9 .cse14 v_ArrVal_2092) .cse2 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse13 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse8 (select .cse15 .cse2)) (.cse0 (select .cse13 .cse2))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2088) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse5 .cse2))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2073) (= .cse8 20) (< (+ .cse8 1) v_ArrVal_2080) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2095) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse10 .cse2))) (not (= (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse14 v_ArrVal_2099) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse2) 20)))))))))))))))))) is different from false [2022-11-26 00:56:39,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2090 Int) (v_ArrVal_2070 Int) (v_ArrVal_2092 Int) (v_ArrVal_2071 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2073 Int) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2095 Int) (v_ArrVal_2098 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2079 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2080 Int) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2084 Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (v_ArrVal_2105 Int)) (let ((.cse19 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2068))) (let ((.cse11 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2070)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_2071) .cse1 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075))) (let ((.cse0 (select .cse18 |c_~#queue~0.base|))) (let ((.cse15 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2077))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2079) .cse1 v_ArrVal_2080)) |c_~#stored_elements~0.base| v_ArrVal_2082))) (let ((.cse7 (select .cse17 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2084))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2086) .cse1 v_ArrVal_2088)) |c_~#stored_elements~0.base| v_ArrVal_2089))) (let ((.cse8 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2090))) (let ((.cse3 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2092) .cse1 v_ArrVal_2095)) |c_~#stored_elements~0.base| v_ArrVal_2096))) (let ((.cse13 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2098))) (let ((.cse6 (select .cse4 .cse1)) (.cse10 (select .cse15 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2099) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2103) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2105)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse8 .cse1))) (= 20 .cse6) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2088) (= .cse10 20) (< (+ .cse10 1) v_ArrVal_2080) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2095) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse13 .cse1))) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2073))))))))))))))))))) is different from false [2022-11-26 00:56:39,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:56:39,849 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 5913 treesize of output 4323 [2022-11-26 00:56:40,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:56:40,139 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 8065 treesize of output 8051 [2022-11-26 00:56:40,199 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 5072 treesize of output 4688 [2022-11-26 00:56:40,274 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 5618 treesize of output 5610 [2022-11-26 00:56:40,340 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 6561 treesize of output 6241 [2022-11-26 00:56:40,452 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 6257 treesize of output 6193 [2022-11-26 00:56:40,529 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 5866 treesize of output 5834 [2022-11-26 00:56:40,607 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 5632 treesize of output 5608 [2022-11-26 00:56:40,821 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 8 treesize of output 4 [2022-11-26 00:56:41,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:56:41,568 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 932 treesize of output 928 [2022-11-26 00:57:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 718 proven. 89 refuted. 80 times theorem prover too weak. 284 trivial. 171 not checked. [2022-11-26 00:57:04,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202266155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:04,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1428632101] [2022-11-26 00:57:04,778 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:57:04,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:57:04,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 39] total 92 [2022-11-26 00:57:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183209065] [2022-11-26 00:57:04,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:57:04,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-11-26 00:57:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-11-26 00:57:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=4475, Unknown=220, NotChecked=2490, Total=8556 [2022-11-26 00:57:04,784 INFO L87 Difference]: Start difference. First operand 3526 states and 6314 transitions. Second operand has 93 states, 93 states have (on average 2.3548387096774195) internal successors, (219), 92 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:57:23,048 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:58:50,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:59:04,337 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:59:19,272 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:59:46,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:00:01,323 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 01:00:21,017 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 01:00:44,301 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 01:01:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:04,017 INFO L93 Difference]: Finished difference Result 7062 states and 12235 transitions. [2022-11-26 01:01:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-26 01:01:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 2.3548387096774195) internal successors, (219), 92 states have internal predecessors, (219), 0 states have call successors, (0), 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 176 [2022-11-26 01:01:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:04,049 INFO L225 Difference]: With dead ends: 7062 [2022-11-26 01:01:04,049 INFO L226 Difference]: Without dead ends: 7062 [2022-11-26 01:01:04,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 302 SyntacticMatches, 63 SemanticMatches, 149 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 10186 ImplicationChecksByTransitivity, 275.3s TimeCoverageRelationStatistics Valid=3882, Invalid=14280, Unknown=258, NotChecked=4230, Total=22650 [2022-11-26 01:01:04,056 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2261 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 280 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 3183 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:04,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 92 Invalid, 5928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2459 Invalid, 6 Unknown, 3183 Unchecked, 39.0s Time] [2022-11-26 01:01:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2022-11-26 01:01:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 5171. [2022-11-26 01:01:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 5170 states have (on average 1.7342359767891682) internal successors, (8966), 5170 states have internal predecessors, (8966), 0 states have call successors, (0), 0 states 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 01:01:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 8966 transitions. [2022-11-26 01:01:04,217 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 8966 transitions. Word has length 176 [2022-11-26 01:01:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:04,217 INFO L495 AbstractCegarLoop]: Abstraction has 5171 states and 8966 transitions. [2022-11-26 01:01:04,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 2.3548387096774195) internal successors, (219), 92 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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 01:01:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 8966 transitions. [2022-11-26 01:01:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-26 01:01:04,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:04,233 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 18, 18, 18, 18, 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 01:01:04,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:04,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 01:01:04,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 01:01:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2078885248, now seen corresponding path program 5 times [2022-11-26 01:01:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:04,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267004371] [2022-11-26 01:01:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 422 proven. 393 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-11-26 01:01:11,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:11,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267004371] [2022-11-26 01:01:11,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267004371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:11,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914538696] [2022-11-26 01:01:11,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:01:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:11,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:11,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:01:14,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-26 01:01:14,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:01:14,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-26 01:01:14,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:14,734 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 01:01:14,734 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 15 treesize of output 15 [2022-11-26 01:01:15,776 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 01:01:15,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:15,840 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 16 treesize of output 18 [2022-11-26 01:01:15,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:01:15,960 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 01:01:15,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 01:01:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:16,044 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 23 treesize of output 22 [2022-11-26 01:01:16,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-11-26 01:01:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:16,227 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 16 treesize of output 18 [2022-11-26 01:01:16,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:01:16,356 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-26 01:01:16,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-26 01:01:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:16,450 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 23 treesize of output 22 [2022-11-26 01:01:16,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-26 01:01:16,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:16,646 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 16 treesize of output 18 [2022-11-26 01:01:16,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:01:16,772 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-26 01:01:16,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-26 01:01:16,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:01:16,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 01:01:16,877 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 16 treesize of output 18 [2022-11-26 01:01:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 352 proven. 103 refuted. 0 times theorem prover too weak. 976 trivial. 0 not checked. [2022-11-26 01:01:16,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:16,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20))) is different from false [2022-11-26 01:01:16,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2523 Int)) (not (= 20 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2523)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2022-11-26 01:01:17,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2521 Int) (v_ArrVal_2523 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2521)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2523))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_~#queue~0.base|) .cse2)) 20))) is different from false [2022-11-26 01:01:18,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| Int) (v_ArrVal_2511 Int) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2521 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2517 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2511)) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| 4)) v_ArrVal_2514)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| (select .cse1 .cse2))) (not (<= v_ArrVal_2511 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (not (= (select (select (store (let ((.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_2517) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2521)) .cse5 v_ArrVal_2523)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_~#queue~0.base|) .cse2) 20)))))))) is different from false [2022-11-26 01:01:19,194 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2509 Int) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| Int) (v_ArrVal_2511 Int) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2521 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2517 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2509) .cse9 v_ArrVal_2511)) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| 4)) v_ArrVal_2514)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| (select .cse0 .cse1))) (not (= (select (select (store (let ((.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2517) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2521)) .cse4 v_ArrVal_2523)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_~#queue~0.base|) .cse1) 20)) (< (+ (select .cse8 .cse9) 1) v_ArrVal_2511) (= 20 .cse7)))))))) is different from false [2022-11-26 01:01:19,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2509 Int) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| Int) (v_ArrVal_2511 Int) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2521 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2517 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2508)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2509) .cse4 v_ArrVal_2511)) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| 4)) v_ArrVal_2514)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse9 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_256| (select .cse0 .cse1))) (= 20 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2511) (not (= (select (select (store (let ((.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2517) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2521)) .cse7 v_ArrVal_2523)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2525) |c_~#queue~0.base|) .cse1) 20))))))))) is different from false [2022-11-26 01:01:37,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:01:37,851 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 798 treesize of output 568 [2022-11-26 01:01:37,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:01:37,916 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 883 treesize of output 877 [2022-11-26 01:01:37,937 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 677 treesize of output 669 [2022-11-26 01:01:37,954 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 570 treesize of output 538 [2022-11-26 01:01:37,972 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 598 treesize of output 550 [2022-11-26 01:01:37,992 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 759 treesize of output 719 [2022-11-26 01:01:38,057 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 8 treesize of output 4 [2022-11-26 01:01:38,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:01:38,185 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 182 treesize of output 178 [2022-11-26 01:01:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 86 proven. 81 refuted. 162 times theorem prover too weak. 976 trivial. 126 not checked. [2022-11-26 01:01:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914538696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [388107506] [2022-11-26 01:01:41,194 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:41,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:41,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 22] total 54 [2022-11-26 01:01:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738393827] [2022-11-26 01:01:41,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:41,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 01:01:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:41,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 01:01:41,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1933, Unknown=73, NotChecked=594, Total=2970 [2022-11-26 01:01:41,203 INFO L87 Difference]: Start difference. First operand 5171 states and 8966 transitions. Second operand has 55 states, 55 states have (on average 2.672727272727273) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:01:51,288 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 01:01:53,726 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 01:01:55,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:01:57,773 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 01:01:59,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:02:16,267 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 177 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:02:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:02:24,260 INFO L93 Difference]: Finished difference Result 6298 states and 10747 transitions. [2022-11-26 01:02:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-26 01:02:24,261 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.672727272727273) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 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 178 [2022-11-26 01:02:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:02:24,282 INFO L225 Difference]: With dead ends: 6298 [2022-11-26 01:02:24,282 INFO L226 Difference]: Without dead ends: 6298 [2022-11-26 01:02:24,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 335 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 5 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=1377, Invalid=4273, Unknown=74, NotChecked=918, Total=6642 [2022-11-26 01:02:24,285 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1307 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 193 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:02:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 66 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1399 Invalid, 5 Unknown, 610 Unchecked, 14.6s Time] [2022-11-26 01:02:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2022-11-26 01:02:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 4742. [2022-11-26 01:02:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4742 states, 4741 states have (on average 1.736553469732124) internal successors, (8233), 4741 states have internal predecessors, (8233), 0 states have call successors, (0), 0 states 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 01:02:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 8233 transitions. [2022-11-26 01:02:24,404 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 8233 transitions. Word has length 178 [2022-11-26 01:02:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:02:24,404 INFO L495 AbstractCegarLoop]: Abstraction has 4742 states and 8233 transitions. [2022-11-26 01:02:24,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.672727272727273) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:02:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 8233 transitions. [2022-11-26 01:02:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-26 01:02:24,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:02:24,416 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 18, 18, 18, 18, 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 01:02:24,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:02:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:02:24,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 01:02:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:02:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1647602596, now seen corresponding path program 6 times [2022-11-26 01:02:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:02:24,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274616771] [2022-11-26 01:02:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:02:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 471 proven. 915 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:02:49,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:02:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274616771] [2022-11-26 01:02:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274616771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:02:49,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931958826] [2022-11-26 01:02:49,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:02:49,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:02:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:02:49,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:02:49,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8212fb2f-e13d-4aaf-939c-6776aea069cd/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:02:50,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:02:50,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:02:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 386 conjunts are in the unsatisfiable core [2022-11-26 01:02:50,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:02:50,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:02:50,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:02:50,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:02:50,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-26 01:02:50,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 01:02:50,221 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 11 treesize of output 11 [2022-11-26 01:02:50,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-11-26 01:02:50,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-26 01:02:50,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-26 01:02:51,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:02:51,029 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 45 treesize of output 47 [2022-11-26 01:02:51,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 56 [2022-11-26 01:02:51,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 54 [2022-11-26 01:02:52,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 63 [2022-11-26 01:02:52,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:02:52,406 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 57 treesize of output 59 [2022-11-26 01:02:52,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 68 [2022-11-26 01:02:54,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 66 [2022-11-26 01:03:03,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 80 [2022-11-26 01:03:04,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:03:04,770 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 74 treesize of output 76 [2022-11-26 01:03:05,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 92 treesize of output 85 [2022-11-26 01:03:15,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 88 treesize of output 83 [2022-11-26 01:03:32,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 104 treesize of output 97 [2022-11-26 01:03:54,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:03:54,331 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 91 treesize of output 93 [2022-11-26 01:03:57,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 109 treesize of output 102 [2022-11-26 01:04:21,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 100 [2022-11-26 01:05:18,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 118 treesize of output 111 [2022-11-26 01:05:55,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:05:55,235 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 200 treesize of output 202 [2022-11-26 01:05:55,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 215 treesize of output 208 [2022-11-26 01:06:29,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 406 treesize of output 401 [2022-11-26 01:07:56,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 318 treesize of output 311 [2022-11-26 01:08:40,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:40,489 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 600 treesize of output 602 [2022-11-26 01:08:43,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 615 treesize of output 608