./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9 --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-6b4ec56 [2022-11-20 18:59:24,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 18:59:24,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 18:59:25,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 18:59:25,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 18:59:25,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 18:59:25,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 18:59:25,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 18:59:25,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 18:59:25,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 18:59:25,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 18:59:25,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 18:59:25,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 18:59:25,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 18:59:25,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 18:59:25,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 18:59:25,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 18:59:25,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 18:59:25,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 18:59:25,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 18:59:25,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 18:59:25,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 18:59:25,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 18:59:25,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 18:59:25,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 18:59:25,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 18:59:25,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 18:59:25,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 18:59:25,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 18:59:25,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 18:59:25,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 18:59:25,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 18:59:25,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 18:59:25,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 18:59:25,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 18:59:25,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 18:59:25,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 18:59:25,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 18:59:25,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 18:59:25,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 18:59:25,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 18:59:25,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 18:59:25,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 18:59:25,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 18:59:25,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 18:59:25,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 18:59:25,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 18:59:25,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 18:59:25,097 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 18:59:25,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 18:59:25,098 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 18:59:25,099 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 18:59:25,099 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 18:59:25,100 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 18:59:25,100 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 18:59:25,100 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 18:59:25,101 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 18:59:25,101 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 18:59:25,101 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 18:59:25,102 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 18:59:25,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 18:59:25,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 18:59:25,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 18:59:25,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 18:59:25,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 18:59:25,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 18:59:25,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 18:59:25,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 18:59:25,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 18:59:25,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 18:59:25,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 18:59:25,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 18:59:25,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 18:59:25,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 18:59:25,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:59:25,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 18:59:25,108 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 18:59:25,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 18:59:25,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 18:59:25,109 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 18:59:25,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 18:59:25,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 18:59:25,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 18:59:25,110 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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-20 18:59:25,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 18:59:25,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 18:59:25,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 18:59:25,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 18:59:25,476 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 18:59:25,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 18:59:28,787 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 18:59:29,163 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 18:59:29,164 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 18:59:29,189 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/data/aadb22c3e/46d4654ea863418297eb7eef8c14aa65/FLAG38adbd850 [2022-11-20 18:59:29,214 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/data/aadb22c3e/46d4654ea863418297eb7eef8c14aa65 [2022-11-20 18:59:29,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 18:59:29,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 18:59:29,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 18:59:29,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 18:59:29,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 18:59:29,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:29,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73512d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29, skipping insertion in model container [2022-11-20 18:59:29,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:29,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 18:59:29,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 18:59:29,767 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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 18:59:29,780 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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 18:59:29,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:59:29,807 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 18:59:29,903 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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 18:59:29,907 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_e8b8db24-5ff3-482f-8d70-60c8a2de6500/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 18:59:29,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:59:29,978 INFO L208 MainTranslator]: Completed translation [2022-11-20 18:59:29,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29 WrapperNode [2022-11-20 18:59:29,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 18:59:29,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 18:59:29,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 18:59:29,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 18:59:29,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,058 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-20 18:59:30,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 18:59:30,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 18:59:30,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 18:59:30,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 18:59:30,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,090 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 18:59:30,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 18:59:30,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 18:59:30,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 18:59:30,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (1/1) ... [2022-11-20 18:59:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:59:30,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:30,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 18:59:30,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 18:59:30,185 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 18:59:30,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 18:59:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 18:59:30,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 18:59:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 18:59:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 18:59:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 18:59:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 18:59:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 18:59:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 18:59:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 18:59:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 18:59:30,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 18:59:30,189 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 18:59:30,371 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 18:59:30,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 18:59:30,728 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 18:59:30,738 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 18:59:30,738 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 18:59:30,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:59:30 BoogieIcfgContainer [2022-11-20 18:59:30,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 18:59:30,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 18:59:30,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 18:59:30,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 18:59:30,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:59:29" (1/3) ... [2022-11-20 18:59:30,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4305d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:59:30, skipping insertion in model container [2022-11-20 18:59:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:29" (2/3) ... [2022-11-20 18:59:30,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4305d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:59:30, skipping insertion in model container [2022-11-20 18:59:30,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:59:30" (3/3) ... [2022-11-20 18:59:30,774 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-20 18:59:30,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 18:59:30,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 18:59:30,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 18:59:30,803 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 18:59:31,040 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 18:59:31,086 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 18:59:31,100 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-20 18:59:31,103 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-20 18:59:31,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-20 18:59:31,201 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-20 18:59:31,201 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 18:59:31,211 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-20 18:59:31,217 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-20 18:59:43,141 INFO L134 LiptonReduction]: Checked pairs total: 21650 [2022-11-20 18:59:43,141 INFO L136 LiptonReduction]: Total number of compositions: 215 [2022-11-20 18:59:43,150 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2022-11-20 18:59:43,209 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-20 18:59:43,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 18:59:43,239 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;@149a2a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 18:59:43,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 18:59:43,244 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-20 18:59:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 18:59:43,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:43,250 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 18:59:43,251 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-20 18:59:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times [2022-11-20 18:59:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:43,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26290181] [2022-11-20 18:59:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:43,426 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-20 18:59:43,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:43,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26290181] [2022-11-20 18:59:43,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26290181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:59:43,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:59:43,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 18:59:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058392820] [2022-11-20 18:59:43,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:59:43,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 18:59:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 18:59:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 18:59:43,470 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-20 18:59:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:43,612 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2022-11-20 18:59:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 18:59:43,615 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-20 18:59:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:43,639 INFO L225 Difference]: With dead ends: 510 [2022-11-20 18:59:43,639 INFO L226 Difference]: Without dead ends: 510 [2022-11-20 18:59:43,640 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-20 18:59:43,642 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-20 18:59:43,643 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-20 18:59:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-20 18:59:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-20 18:59:43,754 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-20 18:59:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2022-11-20 18:59:43,764 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2022-11-20 18:59:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:43,764 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2022-11-20 18:59:43,765 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-20 18:59:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2022-11-20 18:59:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 18:59:43,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:43,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:59:43,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 18:59:43,781 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-20 18:59:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1171630367, now seen corresponding path program 1 times [2022-11-20 18:59:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:43,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164375751] [2022-11-20 18:59:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:44,296 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-20 18:59:44,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164375751] [2022-11-20 18:59:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164375751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:59:44,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:59:44,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 18:59:44,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093024469] [2022-11-20 18:59:44,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:59:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 18:59:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 18:59:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 18:59:44,303 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-20 18:59:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:44,409 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2022-11-20 18:59:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 18:59:44,409 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-20 18:59:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:44,412 INFO L225 Difference]: With dead ends: 220 [2022-11-20 18:59:44,412 INFO L226 Difference]: Without dead ends: 198 [2022-11-20 18:59:44,412 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-20 18:59:44,414 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-20 18:59:44,415 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-20 18:59:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-20 18:59:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-20 18:59:44,426 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-20 18:59:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2022-11-20 18:59:44,428 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2022-11-20 18:59:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:44,429 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2022-11-20 18:59:44,429 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-20 18:59:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2022-11-20 18:59:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 18:59:44,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:44,431 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-20 18:59:44,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 18:59:44,432 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-20 18:59:44,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2092899768, now seen corresponding path program 1 times [2022-11-20 18:59:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:44,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124981268] [2022-11-20 18:59:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:44,528 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-20 18:59:44,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124981268] [2022-11-20 18:59:44,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124981268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:59:44,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:59:44,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 18:59:44,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112253507] [2022-11-20 18:59:44,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:59:44,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 18:59:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:44,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 18:59:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 18:59:44,532 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-20 18:59:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:44,642 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2022-11-20 18:59:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 18:59:44,643 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-20 18:59:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:44,645 INFO L225 Difference]: With dead ends: 258 [2022-11-20 18:59:44,645 INFO L226 Difference]: Without dead ends: 258 [2022-11-20 18:59:44,646 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-20 18:59:44,647 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-20 18:59:44,648 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-20 18:59:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-20 18:59:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2022-11-20 18:59:44,659 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-20 18:59:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2022-11-20 18:59:44,661 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2022-11-20 18:59:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:44,661 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2022-11-20 18:59:44,661 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-20 18:59:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2022-11-20 18:59:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 18:59:44,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:44,663 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-20 18:59:44,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 18:59:44,664 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-20 18:59:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash -985514399, now seen corresponding path program 1 times [2022-11-20 18:59:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:44,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445123150] [2022-11-20 18:59:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:44,787 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-20 18:59:44,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:44,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445123150] [2022-11-20 18:59:44,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445123150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:59:44,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113496774] [2022-11-20 18:59:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:44,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:59:44,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 18:59:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:45,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 18:59:45,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:59:45,117 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-20 18:59:45,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:59:45,159 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-20 18:59:45,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113496774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:59:45,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340727771] [2022-11-20 18:59:45,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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 18:59:45,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:59:45,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-20 18:59:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267397960] [2022-11-20 18:59:45,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:59:45,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 18:59:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 18:59:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 18:59:45,198 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-20 18:59:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:45,385 INFO L93 Difference]: Finished difference Result 384 states and 824 transitions. [2022-11-20 18:59:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 18:59:45,386 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-20 18:59:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:45,388 INFO L225 Difference]: With dead ends: 384 [2022-11-20 18:59:45,388 INFO L226 Difference]: Without dead ends: 384 [2022-11-20 18:59:45,388 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-20 18:59:45,390 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 18:59:45,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 9 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 18:59:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-20 18:59:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-20 18:59:45,402 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-20 18:59:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 824 transitions. [2022-11-20 18:59:45,404 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 824 transitions. Word has length 26 [2022-11-20 18:59:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:45,405 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 824 transitions. [2022-11-20 18:59:45,405 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-20 18:59:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 824 transitions. [2022-11-20 18:59:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 18:59:45,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:45,407 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-20 18:59:45,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 18:59:45,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:45,613 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-20 18:59:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 953933320, now seen corresponding path program 2 times [2022-11-20 18:59:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:45,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706040756] [2022-11-20 18:59:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:45,915 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-20 18:59:45,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706040756] [2022-11-20 18:59:45,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706040756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:59:45,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:59:45,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 18:59:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067763969] [2022-11-20 18:59:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:59:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 18:59:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 18:59:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 18:59:45,919 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-20 18:59:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:46,008 INFO L93 Difference]: Finished difference Result 272 states and 526 transitions. [2022-11-20 18:59:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 18:59:46,009 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-20 18:59:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:46,011 INFO L225 Difference]: With dead ends: 272 [2022-11-20 18:59:46,011 INFO L226 Difference]: Without dead ends: 270 [2022-11-20 18:59:46,011 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-20 18:59:46,012 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-20 18:59:46,013 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-20 18:59:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-20 18:59:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-20 18:59:46,022 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-20 18:59:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2022-11-20 18:59:46,023 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 47 [2022-11-20 18:59:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:46,024 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2022-11-20 18:59:46,024 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-20 18:59:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2022-11-20 18:59:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 18:59:46,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:46,026 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-20 18:59:46,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 18:59:46,026 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-20 18:59:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2121986374, now seen corresponding path program 1 times [2022-11-20 18:59:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:46,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481765071] [2022-11-20 18:59:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:46,328 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-20 18:59:46,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481765071] [2022-11-20 18:59:46,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481765071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:59:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140670958] [2022-11-20 18:59:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:46,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:59:46,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 18:59:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:46,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 18:59:46,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:59:46,662 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-20 18:59:46,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:59:46,790 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-20 18:59:46,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140670958] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:59:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889292637] [2022-11-20 18:59:46,791 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 18:59:46,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:59:46,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-20 18:59:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634645410] [2022-11-20 18:59:46,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:59:46,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 18:59:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 18:59:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 18:59:46,794 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-20 18:59:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:47,242 INFO L93 Difference]: Finished difference Result 510 states and 967 transitions. [2022-11-20 18:59:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 18:59:47,243 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-20 18:59:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:47,247 INFO L225 Difference]: With dead ends: 510 [2022-11-20 18:59:47,247 INFO L226 Difference]: Without dead ends: 510 [2022-11-20 18:59:47,248 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-20 18:59:47,249 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 222 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 18:59:47,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 19 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 18:59:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-20 18:59:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-20 18:59:47,271 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-20 18:59:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 967 transitions. [2022-11-20 18:59:47,273 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 967 transitions. Word has length 48 [2022-11-20 18:59:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:47,274 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 967 transitions. [2022-11-20 18:59:47,274 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-20 18:59:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 967 transitions. [2022-11-20 18:59:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 18:59:47,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:47,279 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-20 18:59:47,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 18:59:47,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 18:59:47,487 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-20 18:59:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash 626664730, now seen corresponding path program 2 times [2022-11-20 18:59:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:47,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632557340] [2022-11-20 18:59:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:48,197 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-20 18:59:48,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:48,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632557340] [2022-11-20 18:59:48,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632557340] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:59:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830026309] [2022-11-20 18:59:48,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 18:59:48,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:48,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:59:48,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 18:59:49,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 18:59:49,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:59:49,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 18:59:49,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:59:49,740 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-20 18:59:49,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:59:49,787 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-20 18:59:49,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:59:49,902 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 18:59:49,903 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-20 18:59:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:59:49,977 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-20 18:59:49,998 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-20 18:59:49,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:59:50,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 18:59:50,313 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-20 18:59:50,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 18:59:50,330 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-20 18:59:50,364 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-20 18:59:50,396 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-20 18:59:50,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 18:59:50,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-20 18:59:50,761 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-20 18:59:50,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830026309] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:59:50,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208102772] [2022-11-20 18:59:50,762 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 18:59:50,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:59:50,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-11-20 18:59:50,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041141975] [2022-11-20 18:59:50,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:59:50,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 18:59:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 18:59:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=470, Unknown=7, NotChecked=0, Total=600 [2022-11-20 18:59:50,766 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-20 18:59:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:52,903 INFO L93 Difference]: Finished difference Result 990 states and 1833 transitions. [2022-11-20 18:59:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 18:59:52,904 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-20 18:59:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:52,909 INFO L225 Difference]: With dead ends: 990 [2022-11-20 18:59:52,910 INFO L226 Difference]: Without dead ends: 990 [2022-11-20 18:59:52,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1054, Invalid=2479, Unknown=7, NotChecked=0, Total=3540 [2022-11-20 18:59:52,913 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1380 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 18:59:52,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 16 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 420 Invalid, 0 Unknown, 483 Unchecked, 0.7s Time] [2022-11-20 18:59:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-11-20 18:59:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 787. [2022-11-20 18:59:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.8536895674300256) internal successors, (1457), 786 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:59:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1457 transitions. [2022-11-20 18:59:52,946 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1457 transitions. Word has length 90 [2022-11-20 18:59:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:52,947 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1457 transitions. [2022-11-20 18:59:52,947 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-20 18:59:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1457 transitions. [2022-11-20 18:59:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-20 18:59:52,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:52,951 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-20 18:59:52,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 18:59:53,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:53,160 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-20 18:59:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1789955963, now seen corresponding path program 1 times [2022-11-20 18:59:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:53,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188513790] [2022-11-20 18:59:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:53,846 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-20 18:59:53,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:53,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188513790] [2022-11-20 18:59:53,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188513790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:59:53,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214711763] [2022-11-20 18:59:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:53,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:59:53,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 18:59:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:54,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 18:59:54,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:59:54,398 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-20 18:59:54,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:59:54,952 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-20 18:59:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214711763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:59:54,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1592840261] [2022-11-20 18:59:54,955 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 18:59:54,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:59:54,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-11-20 18:59:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986594740] [2022-11-20 18:59:54,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:59:54,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 18:59:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:59:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 18:59:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-20 18:59:54,961 INFO L87 Difference]: Start difference. First operand 787 states and 1457 transitions. Second operand has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:59:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:59:55,774 INFO L93 Difference]: Finished difference Result 1606 states and 2939 transitions. [2022-11-20 18:59:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 18:59:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 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-20 18:59:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:59:55,785 INFO L225 Difference]: With dead ends: 1606 [2022-11-20 18:59:55,785 INFO L226 Difference]: Without dead ends: 1606 [2022-11-20 18:59:55,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-20 18:59:55,789 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 746 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 18:59:55,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 33 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 18:59:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2022-11-20 18:59:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2022-11-20 18:59:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.831152647975078) internal successors, (2939), 1605 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:59:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2939 transitions. [2022-11-20 18:59:55,844 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2939 transitions. Word has length 102 [2022-11-20 18:59:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:59:55,848 INFO L495 AbstractCegarLoop]: Abstraction has 1606 states and 2939 transitions. [2022-11-20 18:59:55,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:59:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2939 transitions. [2022-11-20 18:59:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-20 18:59:55,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:59:55,860 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:59:55,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 18:59:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:56,067 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-20 18:59:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:59:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1663199500, now seen corresponding path program 2 times [2022-11-20 18:59:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:59:56,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139808598] [2022-11-20 18:59:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:59:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:59:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:59:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 0 proven. 1725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:59:58,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:59:58,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139808598] [2022-11-20 18:59:58,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139808598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:59:58,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889532272] [2022-11-20 18:59:58,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 18:59:58,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:59:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:59:58,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:59:58,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 18:59:59,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 18:59:59,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:59:59,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 18:59:59,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:59:59,238 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 18:59:59,238 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-20 19:00:01,119 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-20 19:00:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:00:01,184 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-20 19:00:01,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:00:01,328 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 19:00:01,328 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-20 19:00:01,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:00:01,437 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-20 19:00:01,477 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-20 19:00:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 250 proven. 23 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2022-11-20 19:00:01,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:00:01,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1321 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 1600 |c_~#queue~0.offset|)))) (or (= .cse0 (select .cse1 (+ |c_~#queue~0.offset| 1604))) (not (= .cse0 400)))))) is different from false [2022-11-20 19:00:02,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse3 (+ 1600 |c_~#queue~0.offset|)))) (or (not (= 400 .cse0)) (not (= 400 (select .cse1 .cse2))) (= (select .cse3 (+ |c_~#queue~0.offset| 1604)) .cse0))))))) is different from false [2022-11-20 19:00:02,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 (+ 1600 |c_~#queue~0.offset|)))) (or (not (= 400 (select .cse0 .cse1))) (not (= 400 .cse2)) (= (select .cse3 (+ |c_~#queue~0.offset| 1604)) .cse2))))))) is different from false [2022-11-20 19:00:02,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1314 Int) (v_ArrVal_1316 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_1314) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1321) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 1600 |c_~#queue~0.offset|)))) (or (not (= 400 .cse0)) (= .cse0 (select .cse1 (+ |c_~#queue~0.offset| 1604))) (not (= 400 (select .cse2 .cse3))))))))) is different from false [2022-11-20 19:00:02,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:00:02,653 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 420 treesize of output 280 [2022-11-20 19:00:02,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:00:02,676 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 424 treesize of output 422 [2022-11-20 19:00:02,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 256 [2022-11-20 19:00:02,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 312 [2022-11-20 19:00:02,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 328 [2022-11-20 19:00:02,847 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-20 19:00:03,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:00:03,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2022-11-20 19:00:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 99 proven. 70 refuted. 23 times theorem prover too weak. 1452 trivial. 81 not checked. [2022-11-20 19:00:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889532272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:00:04,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [161604160] [2022-11-20 19:00:04,237 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 19:00:04,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:00:04,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 15] total 47 [2022-11-20 19:00:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412460842] [2022-11-20 19:00:04,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:00:04,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 19:00:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:00:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 19:00:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1327, Unknown=75, NotChecked=340, Total=2162 [2022-11-20 19:00:04,244 INFO L87 Difference]: Start difference. First operand 1606 states and 2939 transitions. Second operand has 47 states, 47 states have (on average 5.808510638297872) internal successors, (273), 47 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:00:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:00:23,524 INFO L93 Difference]: Finished difference Result 4504 states and 7535 transitions. [2022-11-20 19:00:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-11-20 19:00:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.808510638297872) internal successors, (273), 47 states have internal predecessors, (273), 0 states have call successors, (0), 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 199 [2022-11-20 19:00:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:00:23,545 INFO L225 Difference]: With dead ends: 4504 [2022-11-20 19:00:23,545 INFO L226 Difference]: Without dead ends: 4504 [2022-11-20 19:00:23,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 508 SyntacticMatches, 77 SemanticMatches, 174 ConstructedPredicates, 4 IntricatePredicates, 22 DeprecatedPredicates, 16898 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=7124, Invalid=22204, Unknown=100, NotChecked=1372, Total=30800 [2022-11-20 19:00:23,554 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1573 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2158 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 19:00:23,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 41 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1198 Invalid, 0 Unknown, 2158 Unchecked, 1.8s Time] [2022-11-20 19:00:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2022-11-20 19:00:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 1600. [2022-11-20 19:00:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 1.8386491557223263) internal successors, (2940), 1599 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:00:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2940 transitions. [2022-11-20 19:00:23,631 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2940 transitions. Word has length 199 [2022-11-20 19:00:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:00:23,632 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2940 transitions. [2022-11-20 19:00:23,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.808510638297872) internal successors, (273), 47 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:00:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2940 transitions. [2022-11-20 19:00:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-20 19:00:23,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:00:23,639 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:00:23,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 19:00:23,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:00:23,848 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-20 19:00:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:00:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash -91673728, now seen corresponding path program 3 times [2022-11-20 19:00:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:00:23,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425783272] [2022-11-20 19:00:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:00:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:00:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:00:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:00:25,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:00:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425783272] [2022-11-20 19:00:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425783272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:00:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946589374] [2022-11-20 19:00:25,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:00:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:00:25,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:00:25,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:00:25,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 19:01:15,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 19:01:15,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:01:15,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 19:01:15,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:01:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:16,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:01:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:17,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946589374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:01:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656388006] [2022-11-20 19:01:17,769 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 19:01:17,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:01:17,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2022-11-20 19:01:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774849778] [2022-11-20 19:01:17,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:01:17,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-20 19:01:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:01:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-20 19:01:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-11-20 19:01:17,775 INFO L87 Difference]: Start difference. First operand 1600 states and 2940 transitions. Second operand has 53 states, 53 states have (on average 7.452830188679245) internal successors, (395), 53 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:01:19,523 INFO L93 Difference]: Finished difference Result 4171 states and 7522 transitions. [2022-11-20 19:01:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 19:01:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 7.452830188679245) internal successors, (395), 53 states have internal predecessors, (395), 0 states have call successors, (0), 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 200 [2022-11-20 19:01:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:01:19,544 INFO L225 Difference]: With dead ends: 4171 [2022-11-20 19:01:19,545 INFO L226 Difference]: Without dead ends: 4171 [2022-11-20 19:01:19,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-11-20 19:01:19,547 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1462 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:01:19,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 62 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 19:01:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-11-20 19:01:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 3100. [2022-11-20 19:01:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3099 states have (on average 1.8280090351726364) internal successors, (5665), 3099 states have internal predecessors, (5665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 5665 transitions. [2022-11-20 19:01:19,707 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 5665 transitions. Word has length 200 [2022-11-20 19:01:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:01:19,708 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 5665 transitions. [2022-11-20 19:01:19,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 7.452830188679245) internal successors, (395), 53 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 5665 transitions. [2022-11-20 19:01:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-11-20 19:01:19,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:01:19,724 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 50, 50, 26, 26, 26, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:01:19,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 19:01:19,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:01:19,939 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-20 19:01:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:01:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -419528458, now seen corresponding path program 4 times [2022-11-20 19:01:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:01:19,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828662407] [2022-11-20 19:01:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:01:19,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:01:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:01:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7653 backedges. 0 proven. 7653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:25,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:01:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828662407] [2022-11-20 19:01:25,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828662407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:01:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979422141] [2022-11-20 19:01:25,695 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 19:01:25,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:01:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:01:25,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:01:25,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 19:01:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:01:26,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 19:01:26,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:01:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7653 backedges. 0 proven. 7653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:27,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:01:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7653 backedges. 0 proven. 7653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979422141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:01:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206066059] [2022-11-20 19:01:31,806 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 19:01:31,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:01:31,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2022-11-20 19:01:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372946561] [2022-11-20 19:01:31,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:01:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-11-20 19:01:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:01:31,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-11-20 19:01:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2022-11-20 19:01:31,817 INFO L87 Difference]: Start difference. First operand 3100 states and 5665 transitions. Second operand has 105 states, 105 states have (on average 7.428571428571429) internal successors, (780), 105 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:01:38,177 INFO L93 Difference]: Finished difference Result 6220 states and 11333 transitions. [2022-11-20 19:01:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-20 19:01:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 7.428571428571429) internal successors, (780), 105 states have internal predecessors, (780), 0 states have call successors, (0), 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 394 [2022-11-20 19:01:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:01:38,197 INFO L225 Difference]: With dead ends: 6220 [2022-11-20 19:01:38,197 INFO L226 Difference]: Without dead ends: 6220 [2022-11-20 19:01:38,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2022-11-20 19:01:38,200 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3248 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3248 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 19:01:38,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3248 Valid, 118 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [667 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 19:01:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2022-11-20 19:01:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 6220. [2022-11-20 19:01:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 6219 states have (on average 1.8223187007557484) internal successors, (11333), 6219 states have internal predecessors, (11333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 11333 transitions. [2022-11-20 19:01:38,348 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 11333 transitions. Word has length 394 [2022-11-20 19:01:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:01:38,349 INFO L495 AbstractCegarLoop]: Abstraction has 6220 states and 11333 transitions. [2022-11-20 19:01:38,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 7.428571428571429) internal successors, (780), 105 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:01:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 11333 transitions. [2022-11-20 19:01:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2022-11-20 19:01:38,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:01:38,393 INFO L195 NwaCegarLoop]: trace histogram [102, 102, 102, 102, 52, 52, 52, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:01:38,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 19:01:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 19:01:38,604 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-20 19:01:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:01:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash -559773130, now seen corresponding path program 5 times [2022-11-20 19:01:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:01:38,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856856503] [2022-11-20 19:01:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:01:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:01:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:01:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32184 backedges. 0 proven. 32184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:01:58,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:01:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856856503] [2022-11-20 19:01:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856856503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:01:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344718409] [2022-11-20 19:01:58,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 19:01:58,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:01:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:01:58,095 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:01:58,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 19:01:59,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 19:01:59,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:01:59,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 19:01:59,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:01:59,428 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:01:59,428 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-20 19:02:09,208 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-20 19:02:09,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:02:09,352 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-20 19:02:09,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 19:02:09,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:02:09,813 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 19:02:09,814 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-20 19:02:09,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:02:09,958 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-20 19:02:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32184 backedges. 805 proven. 404 refuted. 0 times theorem prover too weak. 30975 trivial. 0 not checked. [2022-11-20 19:02:09,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:02:10,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4374) |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 (+ 1600 |c_~#queue~0.offset|)))) (or (= (select .cse0 (+ |c_~#queue~0.offset| 1604)) .cse1) (not (= 400 .cse1)))))) is different from false [2022-11-20 19:02:11,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4370 Int) (v_ArrVal_4374 (Array Int Int)) (v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4369 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4367))) (let ((.cse0 (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4369)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4370) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_4374) |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 (+ 1600 |c_~#queue~0.offset|)))) (or (not (= 400 (select .cse0 .cse1))) (not (= 400 .cse2)) (= .cse2 (select .cse3 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 19:02:11,567 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4370 Int) (v_ArrVal_4374 (Array Int Int)) (v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4369 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4367))) (let ((.cse0 (store (select .cse4 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| 4) |c_~#queue~0.offset|) v_ArrVal_4369)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_4370) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_4374) |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 (+ 1600 |c_~#queue~0.offset|)))) (or (not (= 400 (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1))) (= .cse2 (select .cse3 .cse1)) (not (= 400 .cse2)))))))) is different from false [2022-11-20 19:02:11,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4370 Int) (v_ArrVal_4374 (Array Int Int)) (v_ArrVal_4366 (Array Int Int)) (v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4369 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4366))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4367))) (let ((.cse4 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| 4) |c_~#queue~0.offset|) v_ArrVal_4369)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_4370) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_4374) |c_~#queue~0.base|))) (let ((.cse0 (select .cse1 (+ 1600 |c_~#queue~0.offset|)))) (or (= .cse0 (select .cse1 .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_328| (select (select .cse3 |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse4 .cse2))) (not (= .cse0 400))))))))) is different from false [2022-11-20 19:02:11,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:02:11,630 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 253 treesize of output 183 [2022-11-20 19:02:11,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:02:11,654 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 924 treesize of output 916 [2022-11-20 19:02:11,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 588 [2022-11-20 19:02:11,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:02:11,705 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 868 treesize of output 840 [2022-11-20 19:02:11,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 946 treesize of output 898 [2022-11-20 19:02:11,874 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-20 19:02:12,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:02:12,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2022-11-20 19:02:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32184 backedges. 450 proven. 506 refuted. 50 times theorem prover too weak. 30975 trivial. 203 not checked. [2022-11-20 19:02:16,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344718409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:02:16,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1329134118] [2022-11-20 19:02:16,986 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 19:02:16,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:02:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 7, 15] total 125 [2022-11-20 19:02:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756869956] [2022-11-20 19:02:16,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:02:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-20 19:02:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:02:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-20 19:02:16,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5525, Invalid=8999, Unknown=12, NotChecked=964, Total=15500 [2022-11-20 19:02:16,995 INFO L87 Difference]: Start difference. First operand 6220 states and 11333 transitions. Second operand has 125 states, 125 states have (on average 6.872) internal successors, (859), 125 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:11:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:11:53,765 INFO L93 Difference]: Finished difference Result 8482 states and 15227 transitions. [2022-11-20 19:11:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 426 states. [2022-11-20 19:11:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 125 states have (on average 6.872) internal successors, (859), 125 states have internal predecessors, (859), 0 states have call successors, (0), 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 784 [2022-11-20 19:11:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:11:53,804 INFO L225 Difference]: With dead ends: 8482 [2022-11-20 19:11:53,804 INFO L226 Difference]: Without dead ends: 8482 [2022-11-20 19:11:53,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2612 GetRequests, 1963 SyntacticMatches, 104 SemanticMatches, 545 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 135297 ImplicationChecksByTransitivity, 561.3s TimeCoverageRelationStatistics Valid=74112, Invalid=220198, Unknown=12, NotChecked=4340, Total=298662 [2022-11-20 19:11:53,840 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12933 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 1710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12933 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1710 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2785 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-20 19:11:53,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12933 Valid, 32 Invalid, 7215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1710 Valid, 2720 Invalid, 0 Unknown, 2785 Unchecked, 6.4s Time] [2022-11-20 19:11:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8482 states. [2022-11-20 19:11:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8482 to 6274. [2022-11-20 19:11:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6274 states, 6273 states have (on average 1.8220946915351506) internal successors, (11430), 6273 states have internal predecessors, (11430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:11:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 11430 transitions. [2022-11-20 19:11:54,013 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 11430 transitions. Word has length 784 [2022-11-20 19:11:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:11:54,015 INFO L495 AbstractCegarLoop]: Abstraction has 6274 states and 11430 transitions. [2022-11-20 19:11:54,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 6.872) internal successors, (859), 125 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:11:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 11430 transitions. [2022-11-20 19:11:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2022-11-20 19:11:54,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:11:54,064 INFO L195 NwaCegarLoop]: trace histogram [103, 103, 103, 103, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:11:54,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 19:11:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 19:11:54,272 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-20 19:11:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:11:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -193451437, now seen corresponding path program 6 times [2022-11-20 19:11:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:11:54,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854568688] [2022-11-20 19:11:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:11:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:11:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:12:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 32845 backedges. 0 proven. 32845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:12:14,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:12:14,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854568688] [2022-11-20 19:12:14,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854568688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:12:14,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253273269] [2022-11-20 19:12:14,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:12:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:12:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:12:14,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:12:14,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8b8db24-5ff3-482f-8d70-60c8a2de6500/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process