./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS --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-8393723 [2022-11-19 07:52:37,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:52:37,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:52:37,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:52:37,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:52:37,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:52:37,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:52:37,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:52:37,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:52:37,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:52:37,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:52:37,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:52:37,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:52:37,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:52:37,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:52:37,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:52:37,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:52:37,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:52:37,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:52:37,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:52:37,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:52:37,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:52:37,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:52:37,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:52:37,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:52:37,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:52:37,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:52:37,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:52:37,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:52:37,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:52:37,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:52:37,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:52:37,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:52:37,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:52:37,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:52:37,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:52:37,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:52:37,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:52:37,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:52:37,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:52:37,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:52:37,463 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:52:37,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:52:37,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:52:37,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:52:37,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:52:37,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:52:37,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:52:37,502 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:52:37,503 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:52:37,503 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:52:37,503 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:52:37,504 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:52:37,505 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:52:37,505 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:52:37,505 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:52:37,505 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:52:37,506 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:52:37,506 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:52:37,506 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:52:37,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:52:37,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:52:37,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:52:37,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:52:37,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:52:37,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:52:37,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:52:37,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:52:37,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:52:37,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:52:37,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:52:37,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:52:37,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:52:37,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:52:37,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:52:37,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:52:37,511 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:52:37,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:52:37,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:52:37,512 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:52:37,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:52:37,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:52:37,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:52:37,513 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_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/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_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS 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-19 07:52:37,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:52:37,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:52:37,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:52:37,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:52:37,860 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:52:37,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-19 07:52:37,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/data/396bc1167/e1bf2bf7d6154acbb63d4140f423f43f/FLAG9cba25b8c [2022-11-19 07:52:38,565 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:52:38,566 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-19 07:52:38,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/data/396bc1167/e1bf2bf7d6154acbb63d4140f423f43f/FLAG9cba25b8c [2022-11-19 07:52:38,813 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/data/396bc1167/e1bf2bf7d6154acbb63d4140f423f43f [2022-11-19 07:52:38,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:52:38,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:52:38,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:52:38,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:52:38,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:52:38,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:52:38" (1/1) ... [2022-11-19 07:52:38,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b031e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:38, skipping insertion in model container [2022-11-19 07:52:38,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:52:38" (1/1) ... [2022-11-19 07:52:38,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:52:38,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:52:39,481 WARN L234 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_a70fd117-d01e-4706-8d74-d41269ec7938/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-19 07:52:39,487 WARN L234 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_a70fd117-d01e-4706-8d74-d41269ec7938/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-19 07:52:39,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:52:39,501 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:52:39,554 WARN L234 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_a70fd117-d01e-4706-8d74-d41269ec7938/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-19 07:52:39,561 WARN L234 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_a70fd117-d01e-4706-8d74-d41269ec7938/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-19 07:52:39,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:52:39,634 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:52:39,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39 WrapperNode [2022-11-19 07:52:39,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:52:39,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:52:39,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:52:39,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:52:39,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,728 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-19 07:52:39,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:52:39,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:52:39,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:52:39,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:52:39,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,784 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:52:39,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:52:39,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:52:39,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:52:39,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (1/1) ... [2022-11-19 07:52:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:52:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:52:39,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:52:39,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:52:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-19 07:52:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-19 07:52:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-19 07:52:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-19 07:52:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:52:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:52:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:52:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:52:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 07:52:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:52:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:52:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:52:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:52:39,883 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:52:40,127 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:52:40,129 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:52:40,435 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:52:40,445 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:52:40,446 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:52:40,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:52:40 BoogieIcfgContainer [2022-11-19 07:52:40,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:52:40,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:52:40,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:52:40,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:52:40,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:52:38" (1/3) ... [2022-11-19 07:52:40,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7354d0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:52:40, skipping insertion in model container [2022-11-19 07:52:40,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:52:39" (2/3) ... [2022-11-19 07:52:40,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7354d0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:52:40, skipping insertion in model container [2022-11-19 07:52:40,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:52:40" (3/3) ... [2022-11-19 07:52:40,459 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-19 07:52:40,468 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:52:40,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:52:40,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:52:40,480 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:52:40,602 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-19 07:52:40,654 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:52:40,673 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-19 07:52:40,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-19 07:52:40,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-19 07:52:40,837 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-19 07:52:40,837 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-19 07:52:40,848 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-19 07:52:40,855 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-19 07:52:52,281 INFO L134 LiptonReduction]: Checked pairs total: 20641 [2022-11-19 07:52:52,281 INFO L136 LiptonReduction]: Total number of compositions: 211 [2022-11-19 07:52:52,293 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 53 transitions, 122 flow [2022-11-19 07:52:52,367 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:52,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:52:52,391 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;@561b18ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:52:52,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-19 07:52:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:52:52,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:52,400 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:52:52,400 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-19 07:52:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 896, now seen corresponding path program 1 times [2022-11-19 07:52:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:52,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528099904] [2022-11-19 07:52:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:52,542 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-19 07:52:52,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528099904] [2022-11-19 07:52:52,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528099904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:52:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:52:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:52:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106517887] [2022-11-19 07:52:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:52:52,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:52:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:52:52,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:52:52,592 INFO L87 Difference]: Start difference. First operand has 579 states, 577 states have (on average 2.681109185441941) internal successors, (1547), 578 states have internal predecessors, (1547), 0 states have call successors, (0), 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-19 07:52:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:52,705 INFO L93 Difference]: Finished difference Result 578 states and 1546 transitions. [2022-11-19 07:52:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:52:52,708 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-19 07:52:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:52,723 INFO L225 Difference]: With dead ends: 578 [2022-11-19 07:52:52,723 INFO L226 Difference]: Without dead ends: 578 [2022-11-19 07:52:52,724 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-19 07:52:52,727 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:52,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:52:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-19 07:52:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-11-19 07:52:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 2.679376083188908) internal successors, (1546), 577 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1546 transitions. [2022-11-19 07:52:52,798 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1546 transitions. Word has length 1 [2022-11-19 07:52:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:52,798 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 1546 transitions. [2022-11-19 07:52:52,799 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-19 07:52:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1546 transitions. [2022-11-19 07:52:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:52:52,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:52,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:52:52,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:52:52,803 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-19 07:52:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -126209710, now seen corresponding path program 1 times [2022-11-19 07:52:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539435762] [2022-11-19 07:52:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:53,157 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-19 07:52:53,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539435762] [2022-11-19 07:52:53,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539435762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:52:53,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:52:53,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:52:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364054357] [2022-11-19 07:52:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:52:53,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:52:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:52:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:52:53,162 INFO L87 Difference]: Start difference. First operand 578 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:53,238 INFO L93 Difference]: Finished difference Result 236 states and 510 transitions. [2022-11-19 07:52:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:52:53,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-19 07:52:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:53,240 INFO L225 Difference]: With dead ends: 236 [2022-11-19 07:52:53,241 INFO L226 Difference]: Without dead ends: 214 [2022-11-19 07:52:53,241 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-19 07:52:53,242 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:53,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:52:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-19 07:52:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-19 07:52:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.1971830985915495) internal successors, (468), 213 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 468 transitions. [2022-11-19 07:52:53,254 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 468 transitions. Word has length 16 [2022-11-19 07:52:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:53,255 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 468 transitions. [2022-11-19 07:52:53,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 468 transitions. [2022-11-19 07:52:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:52:53,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:53,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:52:53,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:52:53,258 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-19 07:52:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash 223041115, now seen corresponding path program 1 times [2022-11-19 07:52:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:53,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284560125] [2022-11-19 07:52:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:53,361 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-19 07:52:53,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284560125] [2022-11-19 07:52:53,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284560125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:52:53,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:52:53,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:52:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625795149] [2022-11-19 07:52:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:52:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:52:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:52:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:52:53,364 INFO L87 Difference]: Start difference. First operand 214 states and 468 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:53,455 INFO L93 Difference]: Finished difference Result 274 states and 594 transitions. [2022-11-19 07:52:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:52:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 07:52:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:53,458 INFO L225 Difference]: With dead ends: 274 [2022-11-19 07:52:53,458 INFO L226 Difference]: Without dead ends: 274 [2022-11-19 07:52:53,458 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-19 07:52:53,460 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:53,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:52:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-19 07:52:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2022-11-19 07:52:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.191780821917808) internal successors, (480), 219 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 480 transitions. [2022-11-19 07:52:53,471 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 480 transitions. Word has length 20 [2022-11-19 07:52:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:53,472 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 480 transitions. [2022-11-19 07:52:53,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 480 transitions. [2022-11-19 07:52:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:52:53,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:53,475 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, 1] [2022-11-19 07:52:53,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:52:53,475 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-19 07:52:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1481011095, now seen corresponding path program 1 times [2022-11-19 07:52:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191878193] [2022-11-19 07:52:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:52:53,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:53,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191878193] [2022-11-19 07:52:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191878193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:52:53,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:52:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:52:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593116266] [2022-11-19 07:52:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:52:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:52:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:52:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:52:53,742 INFO L87 Difference]: Start difference. First operand 220 states and 480 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:53,820 INFO L93 Difference]: Finished difference Result 164 states and 328 transitions. [2022-11-19 07:52:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:52:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:52:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:53,822 INFO L225 Difference]: With dead ends: 164 [2022-11-19 07:52:53,822 INFO L226 Difference]: Without dead ends: 162 [2022-11-19 07:52:53,822 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-19 07:52:53,823 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:53,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:52:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-19 07:52:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-19 07:52:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.018633540372671) internal successors, (325), 161 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 325 transitions. [2022-11-19 07:52:53,830 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 325 transitions. Word has length 27 [2022-11-19 07:52:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:53,830 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 325 transitions. [2022-11-19 07:52:53,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 325 transitions. [2022-11-19 07:52:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:52:53,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:53,832 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, 1, 1] [2022-11-19 07:52:53,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:52:53,832 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-19 07:52:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -666955131, now seen corresponding path program 1 times [2022-11-19 07:52:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484388689] [2022-11-19 07:52:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:53,974 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-19 07:52:53,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484388689] [2022-11-19 07:52:53,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484388689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:52:53,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188965527] [2022-11-19 07:52:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:52:53,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:52:54,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:52:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:54,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:52:54,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:52:54,263 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-19 07:52:54,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:52:54,305 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-19 07:52:54,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188965527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:52:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293850508] [2022-11-19 07:52:54,314 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-19 07:52:54,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:52:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-19 07:52:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327541157] [2022-11-19 07:52:54,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:52:54,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:52:54,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:52:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:52:54,324 INFO L87 Difference]: Start difference. First operand 162 states and 325 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:54,558 INFO L93 Difference]: Finished difference Result 282 states and 547 transitions. [2022-11-19 07:52:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:52:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-19 07:52:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:54,562 INFO L225 Difference]: With dead ends: 282 [2022-11-19 07:52:54,562 INFO L226 Difference]: Without dead ends: 282 [2022-11-19 07:52:54,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-19 07:52:54,565 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:54,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 13 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:52:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-19 07:52:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-19 07:52:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.9466192170818506) internal successors, (547), 281 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 547 transitions. [2022-11-19 07:52:54,580 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 547 transitions. Word has length 28 [2022-11-19 07:52:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:54,580 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 547 transitions. [2022-11-19 07:52:54,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 547 transitions. [2022-11-19 07:52:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-19 07:52:54,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:54,585 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, 1] [2022-11-19 07:52:54,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:52:54,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:54,791 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-19 07:52:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash -952871877, now seen corresponding path program 2 times [2022-11-19 07:52:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808286172] [2022-11-19 07:52:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:55,022 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-19 07:52:55,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808286172] [2022-11-19 07:52:55,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808286172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:52:55,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664840834] [2022-11-19 07:52:55,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:52:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:52:55,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:52:55,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:52:55,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 07:52:55,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:52:55,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-19 07:52:55,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:52:55,931 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-19 07:52:55,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:55,968 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-19 07:52:56,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:52:56,062 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:52:56,063 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-19 07:52:56,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:56,128 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-19 07:52:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 07:52:56,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:52:56,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664840834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:52:56,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:52:56,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-19 07:52:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078603092] [2022-11-19 07:52:56,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:52:56,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:52:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:52:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:52:56,150 INFO L87 Difference]: Start difference. First operand 282 states and 547 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:56,387 INFO L93 Difference]: Finished difference Result 442 states and 847 transitions. [2022-11-19 07:52:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:52:56,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-19 07:52:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:56,390 INFO L225 Difference]: With dead ends: 442 [2022-11-19 07:52:56,390 INFO L226 Difference]: Without dead ends: 442 [2022-11-19 07:52:56,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:52:56,391 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 98 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:56,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 8 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:52:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-19 07:52:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 358. [2022-11-19 07:52:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.9131652661064427) internal successors, (683), 357 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 683 transitions. [2022-11-19 07:52:56,407 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 683 transitions. Word has length 49 [2022-11-19 07:52:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:56,407 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 683 transitions. [2022-11-19 07:52:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 683 transitions. [2022-11-19 07:52:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 07:52:56,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:56,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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-19 07:52:56,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:52:56,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:56,617 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-19 07:52:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash -392639782, now seen corresponding path program 1 times [2022-11-19 07:52:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:56,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099257779] [2022-11-19 07:52:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:52:56,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:56,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099257779] [2022-11-19 07:52:56,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099257779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:52:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14043376] [2022-11-19 07:52:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:52:56,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:52:56,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:52:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:57,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:52:57,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:52:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:52:57,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:52:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:52:57,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14043376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:52:57,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2084751917] [2022-11-19 07:52:57,248 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-19 07:52:57,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:52:57,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-19 07:52:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793626107] [2022-11-19 07:52:57,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:52:57,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:52:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:52:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:52:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:52:57,252 INFO L87 Difference]: Start difference. First operand 358 states and 683 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:52:57,543 INFO L93 Difference]: Finished difference Result 736 states and 1367 transitions. [2022-11-19 07:52:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:52:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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 50 [2022-11-19 07:52:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:52:57,548 INFO L225 Difference]: With dead ends: 736 [2022-11-19 07:52:57,548 INFO L226 Difference]: Without dead ends: 736 [2022-11-19 07:52:57,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 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-19 07:52:57,549 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 198 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:52:57,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 18 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:52:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-11-19 07:52:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2022-11-19 07:52:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.8598639455782313) internal successors, (1367), 735 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1367 transitions. [2022-11-19 07:52:57,570 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1367 transitions. Word has length 50 [2022-11-19 07:52:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:52:57,571 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1367 transitions. [2022-11-19 07:52:57,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:52:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1367 transitions. [2022-11-19 07:52:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-19 07:52:57,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:52:57,573 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:52:57,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:52:57,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:57,780 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-19 07:52:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:52:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1781456079, now seen corresponding path program 2 times [2022-11-19 07:52:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:52:57,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267648203] [2022-11-19 07:52:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:52:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:52:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:52:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:52:58,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:52:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267648203] [2022-11-19 07:52:58,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267648203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:52:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994587895] [2022-11-19 07:52:58,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:52:58,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:52:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:52:58,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:52:58,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:52:59,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-19 07:52:59,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:52:59,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-19 07:52:59,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:52:59,511 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-19 07:52:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:59,547 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-19 07:52:59,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:52:59,620 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:52:59,620 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-19 07:52:59,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:59,675 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-19 07:52:59,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:52:59,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:59,809 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-19 07:52:59,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:52:59,902 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:52:59,902 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-19 07:52:59,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:52:59,955 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-19 07:52:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 105 proven. 45 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-19 07:52:59,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:53:00,109 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_734 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_734) .cse1)))))) is different from false [2022-11-19 07:53:00,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_734 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_734) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| (select .cse0 .cse1)))))) is different from false [2022-11-19 07:53:00,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_734 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_734) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| (select .cse0 .cse1)))))) is different from false [2022-11-19 07:53:00,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_730 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_734 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_730) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_734) .cse1) 400))))) is different from false [2022-11-19 07:53:00,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_730 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_728 Int) (v_ArrVal_734 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_728)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_730) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_734) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| (select .cse0 .cse1)))))) is different from false [2022-11-19 07:53:00,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:53:00,470 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 209 treesize of output 149 [2022-11-19 07:53:00,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:53:00,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-11-19 07:53:00,518 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 269 treesize of output 257 [2022-11-19 07:53:00,539 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 257 treesize of output 241 [2022-11-19 07:53:00,574 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-19 07:53:00,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:53:00,683 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 97 treesize of output 89 [2022-11-19 07:53:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 64 proven. 41 refuted. 0 times theorem prover too weak. 133 trivial. 45 not checked. [2022-11-19 07:53:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994587895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:53:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330973891] [2022-11-19 07:53:00,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-19 07:53:00,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:53:00,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 35 [2022-11-19 07:53:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710609658] [2022-11-19 07:53:00,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:53:00,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 07:53:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:53:00,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 07:53:00,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=700, Unknown=8, NotChecked=300, Total=1190 [2022-11-19 07:53:00,960 INFO L87 Difference]: Start difference. First operand 736 states and 1367 transitions. Second operand has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:53:11,776 INFO L93 Difference]: Finished difference Result 2282 states and 4132 transitions. [2022-11-19 07:53:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-19 07:53:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 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 95 [2022-11-19 07:53:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:53:11,787 INFO L225 Difference]: With dead ends: 2282 [2022-11-19 07:53:11,794 INFO L226 Difference]: Without dead ends: 2282 [2022-11-19 07:53:11,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 230 SyntacticMatches, 102 SemanticMatches, 147 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 16852 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=4582, Invalid=16022, Unknown=8, NotChecked=1440, Total=22052 [2022-11-19 07:53:11,803 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1880 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2505 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:53:11,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 38 Invalid, 3640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 881 Invalid, 0 Unknown, 2505 Unchecked, 1.2s Time] [2022-11-19 07:53:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2022-11-19 07:53:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1335. [2022-11-19 07:53:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 1.8290854572713644) internal successors, (2440), 1334 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2440 transitions. [2022-11-19 07:53:11,849 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2440 transitions. Word has length 95 [2022-11-19 07:53:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:53:11,850 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 2440 transitions. [2022-11-19 07:53:11,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2440 transitions. [2022-11-19 07:53:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-19 07:53:11,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:53:11,853 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:53:11,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:53:12,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:12,061 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-19 07:53:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:53:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 528039919, now seen corresponding path program 3 times [2022-11-19 07:53:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:53:12,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670756420] [2022-11-19 07:53:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:53:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:53:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:12,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:53:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670756420] [2022-11-19 07:53:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670756420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:53:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082052391] [2022-11-19 07:53:12,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:53:12,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:12,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:12,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:53:12,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:53:12,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:53:12,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:53:12,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 07:53:12,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:53:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:13,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:53:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082052391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:53:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416783159] [2022-11-19 07:53:13,330 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-19 07:53:13,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:53:13,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-19 07:53:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472336755] [2022-11-19 07:53:13,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:53:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 07:53:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:53:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 07:53:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:53:13,332 INFO L87 Difference]: Start difference. First operand 1335 states and 2440 transitions. Second operand has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:53:13,884 INFO L93 Difference]: Finished difference Result 3367 states and 6039 transitions. [2022-11-19 07:53:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 07:53:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 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 97 [2022-11-19 07:53:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:53:13,899 INFO L225 Difference]: With dead ends: 3367 [2022-11-19 07:53:13,899 INFO L226 Difference]: Without dead ends: 3367 [2022-11-19 07:53:13,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:53:13,900 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 458 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:53:13,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 32 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:53:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2022-11-19 07:53:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2934. [2022-11-19 07:53:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2933 states have (on average 1.8128196385952948) internal successors, (5317), 2933 states have internal predecessors, (5317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5317 transitions. [2022-11-19 07:53:13,978 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5317 transitions. Word has length 97 [2022-11-19 07:53:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:53:13,978 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 5317 transitions. [2022-11-19 07:53:13,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5317 transitions. [2022-11-19 07:53:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-19 07:53:13,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:53:13,985 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 15, 15, 15, 15, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:53:13,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:53:14,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 07:53:14,196 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-19 07:53:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:53:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1743992428, now seen corresponding path program 4 times [2022-11-19 07:53:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:53:14,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637519814] [2022-11-19 07:53:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:53:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:53:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 1534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:15,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:53:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637519814] [2022-11-19 07:53:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637519814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:53:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295279370] [2022-11-19 07:53:15,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:53:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:15,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:53:15,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:53:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:16,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 07:53:16,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:53:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 1534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:16,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:53:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 1534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:17,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295279370] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:53:17,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648391086] [2022-11-19 07:53:17,443 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-19 07:53:17,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:53:17,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-11-19 07:53:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718977395] [2022-11-19 07:53:17,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:53:17,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-19 07:53:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:53:17,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-19 07:53:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 07:53:17,451 INFO L87 Difference]: Start difference. First operand 2934 states and 5317 transitions. Second operand has 49 states, 49 states have (on average 7.591836734693878) internal successors, (372), 49 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:53:18,607 INFO L93 Difference]: Finished difference Result 5982 states and 10741 transitions. [2022-11-19 07:53:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-19 07:53:18,607 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.591836734693878) internal successors, (372), 49 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-11-19 07:53:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:53:18,631 INFO L225 Difference]: With dead ends: 5982 [2022-11-19 07:53:18,631 INFO L226 Difference]: Without dead ends: 5982 [2022-11-19 07:53:18,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 07:53:18,632 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1377 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:53:18,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 54 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-19 07:53:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2022-11-19 07:53:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5982. [2022-11-19 07:53:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5982 states, 5981 states have (on average 1.7958535361979602) internal successors, (10741), 5981 states have internal predecessors, (10741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5982 states to 5982 states and 10741 transitions. [2022-11-19 07:53:18,809 INFO L78 Accepts]: Start accepts. Automaton has 5982 states and 10741 transitions. Word has length 190 [2022-11-19 07:53:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:53:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 5982 states and 10741 transitions. [2022-11-19 07:53:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.591836734693878) internal successors, (372), 49 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5982 states and 10741 transitions. [2022-11-19 07:53:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-19 07:53:18,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:53:18,833 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 33, 33, 33, 33, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:53:18,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:53:19,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 07:53:19,046 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-19 07:53:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:53:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1892472140, now seen corresponding path program 5 times [2022-11-19 07:53:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:53:19,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159663544] [2022-11-19 07:53:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:53:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:53:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6961 backedges. 0 proven. 6961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:23,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:53:23,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159663544] [2022-11-19 07:53:23,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159663544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:53:23,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516931957] [2022-11-19 07:53:23,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:53:23,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:23,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:53:23,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:53:26,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-19 07:53:26,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:53:26,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 07:53:26,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:53:26,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:53:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:53:26,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:53:26,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-19 07:53:26,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-19 07:53:27,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:53:27,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:53:27,053 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-19 07:53:27,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-19 07:53:27,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:53:27,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:53:27,132 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-19 07:53:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6961 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 6735 trivial. 0 not checked. [2022-11-19 07:53:27,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:53:27,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516931957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:53:27,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:53:27,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [49] total 53 [2022-11-19 07:53:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230100373] [2022-11-19 07:53:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:53:27,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:53:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:53:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:53:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1187, Invalid=1569, Unknown=0, NotChecked=0, Total=2756 [2022-11-19 07:53:27,194 INFO L87 Difference]: Start difference. First operand 5982 states and 10741 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:53:27,533 INFO L93 Difference]: Finished difference Result 5956 states and 10689 transitions. [2022-11-19 07:53:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:53:27,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 376 [2022-11-19 07:53:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:53:27,554 INFO L225 Difference]: With dead ends: 5956 [2022-11-19 07:53:27,554 INFO L226 Difference]: Without dead ends: 5956 [2022-11-19 07:53:27,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1199, Invalid=1771, Unknown=0, NotChecked=0, Total=2970 [2022-11-19 07:53:27,556 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:53:27,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:53:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2022-11-19 07:53:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 5956. [2022-11-19 07:53:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5956 states, 5955 states have (on average 1.7949622166246852) internal successors, (10689), 5955 states have internal predecessors, (10689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5956 states to 5956 states and 10689 transitions. [2022-11-19 07:53:27,695 INFO L78 Accepts]: Start accepts. Automaton has 5956 states and 10689 transitions. Word has length 376 [2022-11-19 07:53:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:53:27,695 INFO L495 AbstractCegarLoop]: Abstraction has 5956 states and 10689 transitions. [2022-11-19 07:53:27,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5956 states and 10689 transitions. [2022-11-19 07:53:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-19 07:53:27,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:53:27,730 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 33, 33, 33, 33, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:53:27,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 07:53:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 07:53:27,930 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-19 07:53:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:53:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 144050752, now seen corresponding path program 6 times [2022-11-19 07:53:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:53:27,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287571604] [2022-11-19 07:53:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:53:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:53:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6961 backedges. 0 proven. 6961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:32,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:53:32,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287571604] [2022-11-19 07:53:32,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287571604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:53:32,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593018870] [2022-11-19 07:53:32,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:53:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:32,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:53:32,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:53:33,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:53:33,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:53:33,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 07:53:33,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:53:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6961 backedges. 0 proven. 6961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:33,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:53:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6961 backedges. 0 proven. 6961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:37,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593018870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:53:37,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075881485] [2022-11-19 07:53:37,238 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-19 07:53:37,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:53:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-19 07:53:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841933163] [2022-11-19 07:53:37,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:53:37,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-19 07:53:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:53:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-19 07:53:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 07:53:37,249 INFO L87 Difference]: Start difference. First operand 5956 states and 10689 transitions. Second operand has 97 states, 97 states have (on average 7.670103092783505) internal successors, (744), 97 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:53:41,362 INFO L93 Difference]: Finished difference Result 12052 states and 21537 transitions. [2022-11-19 07:53:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-19 07:53:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 7.670103092783505) internal successors, (744), 97 states have internal predecessors, (744), 0 states have call successors, (0), 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 376 [2022-11-19 07:53:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:53:41,402 INFO L225 Difference]: With dead ends: 12052 [2022-11-19 07:53:41,402 INFO L226 Difference]: Without dead ends: 12052 [2022-11-19 07:53:41,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 07:53:41,405 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2429 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:53:41,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 118 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 07:53:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12052 states. [2022-11-19 07:53:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12052 to 12052. [2022-11-19 07:53:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 12051 states have (on average 1.7871545929798356) internal successors, (21537), 12051 states have internal predecessors, (21537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 21537 transitions. [2022-11-19 07:53:41,677 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 21537 transitions. Word has length 376 [2022-11-19 07:53:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:53:41,678 INFO L495 AbstractCegarLoop]: Abstraction has 12052 states and 21537 transitions. [2022-11-19 07:53:41,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 7.670103092783505) internal successors, (744), 97 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:53:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 21537 transitions. [2022-11-19 07:53:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2022-11-19 07:53:41,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:53:41,722 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 94, 94, 69, 69, 69, 69, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:53:41,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:53:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:41,936 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-19 07:53:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:53:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash 146361856, now seen corresponding path program 7 times [2022-11-19 07:53:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:53:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154689146] [2022-11-19 07:53:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:53:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:53:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29587 backedges. 0 proven. 29587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:54,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:53:54,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154689146] [2022-11-19 07:53:54,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154689146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:53:54,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573906061] [2022-11-19 07:53:54,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:53:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:53:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:54,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:53:54,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:53:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:53:55,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 4974 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 07:53:55,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:53:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29587 backedges. 0 proven. 29587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:53:56,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29587 backedges. 0 proven. 29587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:08,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573906061] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:08,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1510244255] [2022-11-19 07:54:08,796 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-19 07:54:08,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:54:08,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2022-11-19 07:54:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283433451] [2022-11-19 07:54:08,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:54:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2022-11-19 07:54:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2022-11-19 07:54:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2022-11-19 07:54:08,813 INFO L87 Difference]: Start difference. First operand 12052 states and 21537 transitions. Second operand has 193 states, 193 states have (on average 7.709844559585492) internal successors, (1488), 193 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:32,204 INFO L93 Difference]: Finished difference Result 24244 states and 43233 transitions. [2022-11-19 07:54:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-11-19 07:54:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 7.709844559585492) internal successors, (1488), 193 states have internal predecessors, (1488), 0 states have call successors, (0), 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 748 [2022-11-19 07:54:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:32,265 INFO L225 Difference]: With dead ends: 24244 [2022-11-19 07:54:32,266 INFO L226 Difference]: Without dead ends: 24244 [2022-11-19 07:54:32,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1591 GetRequests, 1400 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2022-11-19 07:54:32,270 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8209 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 1479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8209 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1479 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:32,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8209 Valid, 206 Invalid, 4176 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1479 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-19 07:54:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24244 states. [2022-11-19 07:54:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24244 to 24244. [2022-11-19 07:54:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24244 states, 24243 states have (on average 1.7833188961762159) internal successors, (43233), 24243 states have internal predecessors, (43233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24244 states to 24244 states and 43233 transitions. [2022-11-19 07:54:32,738 INFO L78 Accepts]: Start accepts. Automaton has 24244 states and 43233 transitions. Word has length 748 [2022-11-19 07:54:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:32,740 INFO L495 AbstractCegarLoop]: Abstraction has 24244 states and 43233 transitions. [2022-11-19 07:54:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 7.709844559585492) internal successors, (1488), 193 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:54:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24244 states and 43233 transitions. [2022-11-19 07:54:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2022-11-19 07:54:32,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:32,858 INFO L195 NwaCegarLoop]: trace histogram [190, 190, 190, 190, 141, 141, 141, 141, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:54:32,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:33,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 07:54:33,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-19 07:54:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1418021504, now seen corresponding path program 8 times [2022-11-19 07:54:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267622801] [2022-11-19 07:54:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 121927 backedges. 0 proven. 121927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:55:26,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:55:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267622801] [2022-11-19 07:55:26,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267622801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682021032] [2022-11-19 07:55:26,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:55:26,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:26,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:26,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a70fd117-d01e-4706-8d74-d41269ec7938/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:55:30,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-19 07:55:30,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:55:30,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-19 07:55:30,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:41,881 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-19 07:55:42,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:42,022 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-19 07:55:42,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:55:42,251 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:55:42,252 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-19 07:55:42,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:42,432 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-19 07:55:42,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-19 07:55:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:42,835 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-19 07:55:43,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:55:43,069 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 07:55:43,069 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-19 07:55:43,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:43,258 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-19 07:55:43,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:55:43,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:43,643 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-19 07:55:43,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:55:43,873 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 07:55:43,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 07:55:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:44,067 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-19 07:55:44,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:55:44,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:44,456 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-19 07:55:44,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:55:44,775 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 07:55:44,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-19 07:55:44,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:55:44,952 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-19 07:55:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 121927 backedges. 5152 proven. 969 refuted. 0 times theorem prover too weak. 115806 trivial. 0 not checked. [2022-11-19 07:55:44,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:47,250 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7746 (Array Int Int))) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7743) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_7747)) .cse2)))))))) is different from false [2022-11-19 07:55:47,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7741)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7743) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse2)))))))) is different from false [2022-11-19 07:55:47,890 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7741)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_7743) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse2)))))))) is different from false [2022-11-19 07:55:47,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (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) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_7741)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_7743) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse1))) (= 400 .cse4)))))) is different from false [2022-11-19 07:55:49,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_7736 Int) (v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7736) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7741)))) (let ((.cse5 (select .cse4 .cse2))) (or (not (= 400 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_7743) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_7747)) .cse2))) (= 400 .cse5))))))))) is different from false [2022-11-19 07:55:49,235 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7736 Int) (v_ArrVal_7747 Int) (v_ArrVal_7743 Int) (v_ArrVal_7733 Int) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse7 (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_7733)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7736) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7741)))) (let ((.cse5 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_7743) .cse2 (+ 1 .cse5))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse2) 400)) (= 400 .cse5)))))))) is different from false [2022-11-19 07:55:50,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7736 Int) (v_ArrVal_7747 Int) (v_ArrVal_7732 (Array Int Int)) (v_ArrVal_7743 Int) (v_ArrVal_7733 Int) (v_ArrVal_7746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| Int) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7732))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| 4) |c_~#queue~0.offset|) v_ArrVal_7733)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_7736) .cse1 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7741)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_7743) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_7747)) .cse1))) (= 400 .cse5) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| (select .cse7 .cse1)))))))))))) is different from false [2022-11-19 07:55:53,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 Int) (v_ArrVal_7736 Int) (v_ArrVal_7747 Int) (v_ArrVal_7732 (Array Int Int)) (v_ArrVal_7731 Int) (v_ArrVal_7743 Int) (v_ArrVal_7733 Int) (v_ArrVal_7746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| Int) (v_ArrVal_7739 (Array Int Int)) (v_ArrVal_7741 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_7729) .cse8 v_ArrVal_7731)) |c_~#stored_elements~0.base| v_ArrVal_7732))) (let ((.cse1 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| 4) |c_~#queue~0.offset|) v_ArrVal_7733)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (select .cse12 .cse2))) (let ((.cse4 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_7736) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse5 (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) v_ArrVal_7741)))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_7743) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse2))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_7731) (= 400 .cse9))))))))))) is different from false [2022-11-19 07:56:14,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 Int) (v_ArrVal_7736 Int) (v_ArrVal_7747 Int) (v_ArrVal_7727 Int) (v_ArrVal_7731 Int) (v_ArrVal_7743 Int) (v_ArrVal_7733 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| Int) (v_ArrVal_7741 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| Int) (v_ArrVal_7732 (Array Int Int)) (v_ArrVal_7746 (Array Int Int)) (v_ArrVal_7725 (Array Int Int)) (v_ArrVal_7739 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_7725))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| 4) |c_~#queue~0.offset|) v_ArrVal_7727)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_7729) .cse1 v_ArrVal_7731)) |c_~#stored_elements~0.base| v_ArrVal_7732))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| 4) |c_~#queue~0.offset|) v_ArrVal_7733))) (let ((.cse9 (select .cse12 .cse1))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_7736) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_7739))) (let ((.cse6 (let ((.cse10 (select .cse5 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse1))) v_ArrVal_7741)))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_481| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_483| (select .cse2 .cse1))) (= 400 .cse3) (not (= 400 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_7743) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_7746) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_7747)) .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_7731) (= .cse9 400))))))))))))) is different from false [2022-11-19 07:56:14,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:56:14,350 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 2648 treesize of output 1878 [2022-11-19 07:56:14,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:56:14,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2364 treesize of output 2340 [2022-11-19 07:56:14,457 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 1756 treesize of output 1748 [2022-11-19 07:56:14,495 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 1568 treesize of output 1472 [2022-11-19 07:56:14,533 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 2000 treesize of output 1872 [2022-11-19 07:56:14,581 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 2008 treesize of output 1928 [2022-11-19 07:56:14,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-19 07:56:14,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:56:14,781 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 506 treesize of output 502 [2022-11-19 07:56:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 121927 backedges. 1625 proven. 1500 refuted. 1025 times theorem prover too weak. 115806 trivial. 1971 not checked. [2022-11-19 07:56:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682021032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:56:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103772880] [2022-11-19 07:56:29,995 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-19 07:56:29,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:56:29,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 19, 27] total 237 [2022-11-19 07:56:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22228736] [2022-11-19 07:56:29,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:56:30,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 237 states [2022-11-19 07:56:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:56:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2022-11-19 07:56:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18906, Invalid=32777, Unknown=109, NotChecked=4140, Total=55932 [2022-11-19 07:56:30,013 INFO L87 Difference]: Start difference. First operand 24244 states and 43233 transitions. Second operand has 237 states, 237 states have (on average 6.755274261603375) internal successors, (1601), 237 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)