./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0 --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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- 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-e04fb08 [2022-11-16 20:27:31,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:27:31,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:27:31,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:27:31,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:27:31,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:27:31,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:27:31,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:27:31,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:27:31,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:27:31,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:27:31,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:27:31,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:27:31,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:27:31,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:27:32,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:27:32,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:27:32,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:27:32,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:27:32,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:27:32,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:27:32,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:27:32,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:27:32,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:27:32,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:27:32,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:27:32,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:27:32,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:27:32,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:27:32,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:27:32,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:27:32,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:27:32,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:27:32,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:27:32,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:27:32,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:27:32,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:27:32,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:27:32,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:27:32,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:27:32,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:27:32,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:27:32,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:27:32,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:27:32,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:27:32,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:27:32,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:27:32,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:27:32,105 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:27:32,105 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:27:32,105 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:27:32,105 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:27:32,106 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:27:32,107 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:27:32,107 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:27:32,107 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:27:32,107 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:27:32,108 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:27:32,108 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:27:32,108 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:27:32,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:27:32,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:27:32,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:27:32,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:27:32,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:27:32,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:27:32,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:27:32,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:27:32,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:27:32,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:27:32,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:27:32,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:27:32,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:27:32,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:27:32,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:27:32,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:27:32,114 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:27:32,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:27:32,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:27:32,114 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:27:32,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:27:32,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:27:32,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:27:32,115 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_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/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_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2022-11-16 20:27:32,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:27:32,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:27:32,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:27:32,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:27:32,438 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:27:32,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2022-11-16 20:27:32,502 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/data/36ac0827c/1e058fb20ec94c0b91dffcb47f179416/FLAGf369ec0c9 [2022-11-16 20:27:33,106 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:27:33,107 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/sv-benchmarks/c/pthread/triangular-longest-2.i [2022-11-16 20:27:33,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/data/36ac0827c/1e058fb20ec94c0b91dffcb47f179416/FLAGf369ec0c9 [2022-11-16 20:27:33,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/data/36ac0827c/1e058fb20ec94c0b91dffcb47f179416 [2022-11-16 20:27:33,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:27:33,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:27:33,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:27:33,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:27:33,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:27:33,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:27:33" (1/1) ... [2022-11-16 20:27:33,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a62cb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:33, skipping insertion in model container [2022-11-16 20:27:33,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:27:33" (1/1) ... [2022-11-16 20:27:33,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:27:33,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:27:33,979 WARN L229 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_a4b9e577-af01-4d84-96be-02d44c879c05/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2022-11-16 20:27:33,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:27:33,991 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:27:34,032 WARN L229 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_a4b9e577-af01-4d84-96be-02d44c879c05/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2022-11-16 20:27:34,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:27:34,063 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:27:34,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34 WrapperNode [2022-11-16 20:27:34,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:27:34,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:27:34,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:27:34,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:27:34,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,102 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-11-16 20:27:34,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:27:34,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:27:34,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:27:34,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:27:34,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:27:34,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:27:34,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:27:34,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:27:34,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (1/1) ... [2022-11-16 20:27:34,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:27:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:34,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:27:34,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:27:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 20:27:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 20:27:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 20:27:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:27:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:27:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:27:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:27:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:27:34,225 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:27:34,398 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:27:34,401 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:27:34,568 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:27:34,575 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:27:34,576 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 20:27:34,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:27:34 BoogieIcfgContainer [2022-11-16 20:27:34,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:27:34,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:27:34,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:27:34,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:27:34,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:27:33" (1/3) ... [2022-11-16 20:27:34,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220256c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:27:34, skipping insertion in model container [2022-11-16 20:27:34,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:27:34" (2/3) ... [2022-11-16 20:27:34,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220256c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:27:34, skipping insertion in model container [2022-11-16 20:27:34,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:27:34" (3/3) ... [2022-11-16 20:27:34,600 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2022-11-16 20:27:34,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 20:27:34,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:27:34,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 20:27:34,639 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:27:34,726 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:27:34,777 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:27:34,795 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 150 flow [2022-11-16 20:27:34,802 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 70 transitions, 150 flow [2022-11-16 20:27:34,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-11-16 20:27:34,856 INFO L130 PetriNetUnfolder]: 5/68 cut-off events. [2022-11-16 20:27:34,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:27:34,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-11-16 20:27:34,863 INFO L119 LiptonReduction]: Number of co-enabled transitions 1122 [2022-11-16 20:27:37,578 INFO L134 LiptonReduction]: Checked pairs total: 1060 [2022-11-16 20:27:37,579 INFO L136 LiptonReduction]: Total number of compositions: 62 [2022-11-16 20:27:37,595 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2022-11-16 20:27:37,620 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:37,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:27:37,651 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5856a157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:27:37,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 20:27:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 20:27:37,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:37,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 20:27:37,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -453796970, now seen corresponding path program 1 times [2022-11-16 20:27:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:37,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261019665] [2022-11-16 20:27:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:38,077 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-16 20:27:38,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:38,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261019665] [2022-11-16 20:27:38,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261019665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:38,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:27:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355595204] [2022-11-16 20:27:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:38,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:27:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:38,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:27:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:27:38,111 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:38,181 INFO L93 Difference]: Finished difference Result 44 states and 107 transitions. [2022-11-16 20:27:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:27:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-16 20:27:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:38,194 INFO L225 Difference]: With dead ends: 44 [2022-11-16 20:27:38,194 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 20:27:38,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:27:38,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:38,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:27:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 20:27:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 20:27:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 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-16 20:27:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2022-11-16 20:27:38,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2022-11-16 20:27:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:38,239 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2022-11-16 20:27:38,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2022-11-16 20:27:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:27:38,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:38,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:38,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:27:38,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1987764376, now seen corresponding path program 1 times [2022-11-16 20:27:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804985025] [2022-11-16 20:27:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:38,413 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-16 20:27:38,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804985025] [2022-11-16 20:27:38,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804985025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:38,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:38,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:27:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235102436] [2022-11-16 20:27:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:38,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:27:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:27:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:27:38,417 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:38,523 INFO L93 Difference]: Finished difference Result 82 states and 192 transitions. [2022-11-16 20:27:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:27:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:27:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:38,530 INFO L225 Difference]: With dead ends: 82 [2022-11-16 20:27:38,531 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 20:27:38,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:27:38,534 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:38,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 20:27:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-11-16 20:27:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.5294117647058822) internal successors, (129), 51 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 129 transitions. [2022-11-16 20:27:38,561 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 129 transitions. Word has length 8 [2022-11-16 20:27:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:38,562 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 129 transitions. [2022-11-16 20:27:38,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 129 transitions. [2022-11-16 20:27:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:27:38,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:38,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:38,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:27:38,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1987464916, now seen corresponding path program 2 times [2022-11-16 20:27:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:38,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825771235] [2022-11-16 20:27:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:38,695 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-16 20:27:38,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825771235] [2022-11-16 20:27:38,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825771235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:38,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:38,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:27:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250742033] [2022-11-16 20:27:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:38,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:27:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:27:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:27:38,698 INFO L87 Difference]: Start difference. First operand 52 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:38,803 INFO L93 Difference]: Finished difference Result 70 states and 163 transitions. [2022-11-16 20:27:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:27:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 20:27:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:38,804 INFO L225 Difference]: With dead ends: 70 [2022-11-16 20:27:38,804 INFO L226 Difference]: Without dead ends: 54 [2022-11-16 20:27:38,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:27:38,806 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:38,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-16 20:27:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2022-11-16 20:27:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 37 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-11-16 20:27:38,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 90 transitions. Word has length 8 [2022-11-16 20:27:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:38,812 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 90 transitions. [2022-11-16 20:27:38,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 90 transitions. [2022-11-16 20:27:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:27:38,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:38,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:38,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:27:38,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1632060875, now seen corresponding path program 1 times [2022-11-16 20:27:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528973151] [2022-11-16 20:27:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:38,981 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-16 20:27:38,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528973151] [2022-11-16 20:27:38,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528973151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:38,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:38,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:27:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462660962] [2022-11-16 20:27:38,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:27:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:38,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:27:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:27:38,983 INFO L87 Difference]: Start difference. First operand 38 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:39,098 INFO L93 Difference]: Finished difference Result 78 states and 182 transitions. [2022-11-16 20:27:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:27:39,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-16 20:27:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:39,100 INFO L225 Difference]: With dead ends: 78 [2022-11-16 20:27:39,100 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 20:27:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:27:39,101 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:39,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 20:27:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-11-16 20:27:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 115 transitions. [2022-11-16 20:27:39,110 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 115 transitions. Word has length 10 [2022-11-16 20:27:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:39,111 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 115 transitions. [2022-11-16 20:27:39,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 115 transitions. [2022-11-16 20:27:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:27:39,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:39,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:39,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:27:39,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1631761415, now seen corresponding path program 2 times [2022-11-16 20:27:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:39,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877070539] [2022-11-16 20:27:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:39,246 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-16 20:27:39,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:39,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877070539] [2022-11-16 20:27:39,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877070539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:27:39,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:27:39,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:27:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695638305] [2022-11-16 20:27:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:27:39,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:27:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:27:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:27:39,249 INFO L87 Difference]: Start difference. First operand 46 states and 115 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:39,371 INFO L93 Difference]: Finished difference Result 56 states and 131 transitions. [2022-11-16 20:27:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:27:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-16 20:27:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:39,372 INFO L225 Difference]: With dead ends: 56 [2022-11-16 20:27:39,372 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 20:27:39,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-16 20:27:39,374 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:39,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 20:27:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-11-16 20:27:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-16 20:27:39,380 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 10 [2022-11-16 20:27:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:39,380 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-16 20:27:39,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-16 20:27:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 20:27:39,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:39,381 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:39,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:27:39,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash -954981636, now seen corresponding path program 3 times [2022-11-16 20:27:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:39,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336842896] [2022-11-16 20:27:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:39,528 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-16 20:27:39,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336842896] [2022-11-16 20:27:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336842896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233098930] [2022-11-16 20:27:39,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:39,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:39,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:39,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:39,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:27:39,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:39,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:39,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 20:27:39,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:39,829 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-16 20:27:39,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:39,997 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-16 20:27:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233098930] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055140629] [2022-11-16 20:27:40,005 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-16 20:27:40,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:40,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 20:27:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623636863] [2022-11-16 20:27:40,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:40,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 20:27:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 20:27:40,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-16 20:27:40,014 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:40,345 INFO L93 Difference]: Finished difference Result 72 states and 177 transitions. [2022-11-16 20:27:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 20:27:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 20:27:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:40,348 INFO L225 Difference]: With dead ends: 72 [2022-11-16 20:27:40,349 INFO L226 Difference]: Without dead ends: 47 [2022-11-16 20:27:40,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2022-11-16 20:27:40,352 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:40,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-16 20:27:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-11-16 20:27:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-16 20:27:40,358 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2022-11-16 20:27:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:40,359 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-16 20:27:40,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-16 20:27:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 20:27:40,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:40,360 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:40,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:40,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -856216761, now seen corresponding path program 4 times [2022-11-16 20:27:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:40,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031153228] [2022-11-16 20:27:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:40,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:40,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031153228] [2022-11-16 20:27:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031153228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:40,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348015288] [2022-11-16 20:27:40,815 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:40,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:40,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:40,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:27:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:40,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 20:27:40,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:41,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:41,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348015288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:41,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898797308] [2022-11-16 20:27:41,249 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-16 20:27:41,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:41,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-16 20:27:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078754261] [2022-11-16 20:27:41,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:41,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 20:27:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 20:27:41,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-16 20:27:41,262 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:41,550 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2022-11-16 20:27:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 20:27:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 14 [2022-11-16 20:27:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:41,551 INFO L225 Difference]: With dead ends: 91 [2022-11-16 20:27:41,551 INFO L226 Difference]: Without dead ends: 66 [2022-11-16 20:27:41,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2022-11-16 20:27:41,553 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:41,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:27:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-16 20:27:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-11-16 20:27:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2022-11-16 20:27:41,558 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2022-11-16 20:27:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:41,558 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2022-11-16 20:27:41,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2022-11-16 20:27:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 20:27:41,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:41,559 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:41,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:41,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:41,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1187192601, now seen corresponding path program 5 times [2022-11-16 20:27:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:41,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537056684] [2022-11-16 20:27:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:42,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537056684] [2022-11-16 20:27:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537056684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497580989] [2022-11-16 20:27:42,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:42,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:42,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:27:42,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:27:42,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:42,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 20:27:42,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:42,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:42,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497580989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:42,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453977091] [2022-11-16 20:27:42,302 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-16 20:27:42,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:42,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-16 20:27:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95204164] [2022-11-16 20:27:42,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:42,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 20:27:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 20:27:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-16 20:27:42,305 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:42,793 INFO L93 Difference]: Finished difference Result 151 states and 337 transitions. [2022-11-16 20:27:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 20:27:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 14 [2022-11-16 20:27:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:42,794 INFO L225 Difference]: With dead ends: 151 [2022-11-16 20:27:42,794 INFO L226 Difference]: Without dead ends: 124 [2022-11-16 20:27:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 20:27:42,796 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:42,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-16 20:27:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 69. [2022-11-16 20:27:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.514705882352941) internal successors, (171), 68 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 171 transitions. [2022-11-16 20:27:42,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 171 transitions. Word has length 14 [2022-11-16 20:27:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:42,802 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 171 transitions. [2022-11-16 20:27:42,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 171 transitions. [2022-11-16 20:27:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 20:27:42,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:42,803 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:42,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:43,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:43,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1731261201, now seen corresponding path program 6 times [2022-11-16 20:27:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:43,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522804351] [2022-11-16 20:27:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:43,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522804351] [2022-11-16 20:27:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522804351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667510059] [2022-11-16 20:27:43,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:43,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:43,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:27:43,271 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:43,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:43,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 20:27:43,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:43,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667510059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2082305554] [2022-11-16 20:27:43,461 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-16 20:27:43,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:43,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-16 20:27:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661630064] [2022-11-16 20:27:43,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:43,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 20:27:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:43,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 20:27:43,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-16 20:27:43,463 INFO L87 Difference]: Start difference. First operand 69 states and 171 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:44,033 INFO L93 Difference]: Finished difference Result 153 states and 367 transitions. [2022-11-16 20:27:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 20:27:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 14 [2022-11-16 20:27:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:44,035 INFO L225 Difference]: With dead ends: 153 [2022-11-16 20:27:44,035 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 20:27:44,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=954, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 20:27:44,036 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:44,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 20:27:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2022-11-16 20:27:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.515625) internal successors, (161), 64 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2022-11-16 20:27:44,042 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2022-11-16 20:27:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:44,042 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2022-11-16 20:27:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2022-11-16 20:27:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 20:27:44,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:44,044 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:44,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:44,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:44,245 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -371722598, now seen corresponding path program 7 times [2022-11-16 20:27:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:44,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387789718] [2022-11-16 20:27:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:44,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387789718] [2022-11-16 20:27:44,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387789718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330332138] [2022-11-16 20:27:44,455 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:44,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:44,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:44,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:27:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:44,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:27:44,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:44,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:44,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330332138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:44,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1735274008] [2022-11-16 20:27:44,852 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-16 20:27:44,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:44,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-11-16 20:27:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043059939] [2022-11-16 20:27:44,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:44,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 20:27:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 20:27:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-16 20:27:44,855 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:45,458 INFO L93 Difference]: Finished difference Result 209 states and 472 transitions. [2022-11-16 20:27:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 20:27:45,459 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 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 17 [2022-11-16 20:27:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:45,461 INFO L225 Difference]: With dead ends: 209 [2022-11-16 20:27:45,461 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 20:27:45,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=599, Invalid=1563, Unknown=0, NotChecked=0, Total=2162 [2022-11-16 20:27:45,464 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:45,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 20:27:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 83. [2022-11-16 20:27:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.5853658536585367) internal successors, (212), 82 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 212 transitions. [2022-11-16 20:27:45,491 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 212 transitions. Word has length 17 [2022-11-16 20:27:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:45,492 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 212 transitions. [2022-11-16 20:27:45,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 212 transitions. [2022-11-16 20:27:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 20:27:45,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:45,495 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:45,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 20:27:45,700 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -578084592, now seen corresponding path program 8 times [2022-11-16 20:27:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:45,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55956387] [2022-11-16 20:27:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:45,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55956387] [2022-11-16 20:27:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55956387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800443369] [2022-11-16 20:27:45,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:45,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:45,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 20:27:45,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 20:27:45,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:45,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 20:27:45,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:46,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:27:46,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800443369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:46,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601711717] [2022-11-16 20:27:46,227 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-16 20:27:46,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:46,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-11-16 20:27:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653050528] [2022-11-16 20:27:46,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:46,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 20:27:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 20:27:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-11-16 20:27:46,230 INFO L87 Difference]: Start difference. First operand 83 states and 212 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:47,158 INFO L93 Difference]: Finished difference Result 183 states and 441 transitions. [2022-11-16 20:27:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 20:27:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 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 17 [2022-11-16 20:27:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:47,160 INFO L225 Difference]: With dead ends: 183 [2022-11-16 20:27:47,160 INFO L226 Difference]: Without dead ends: 118 [2022-11-16 20:27:47,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=974, Invalid=2106, Unknown=0, NotChecked=0, Total=3080 [2022-11-16 20:27:47,162 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:47,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:27:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-16 20:27:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 61. [2022-11-16 20:27:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.466666666666667) internal successors, (148), 60 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 148 transitions. [2022-11-16 20:27:47,167 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 148 transitions. Word has length 17 [2022-11-16 20:27:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:47,167 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 148 transitions. [2022-11-16 20:27:47,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 148 transitions. [2022-11-16 20:27:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:27:47,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:47,169 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:47,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 20:27:47,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -880848175, now seen corresponding path program 9 times [2022-11-16 20:27:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962488743] [2022-11-16 20:27:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:47,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:47,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962488743] [2022-11-16 20:27:47,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962488743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:47,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039625447] [2022-11-16 20:27:47,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:27:47,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:47,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:47,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:47,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 20:27:47,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:27:47,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:47,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 20:27:47,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:48,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:48,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039625447] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:48,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969154482] [2022-11-16 20:27:48,391 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-16 20:27:48,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:48,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2022-11-16 20:27:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535007309] [2022-11-16 20:27:48,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 20:27:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 20:27:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 20:27:48,394 INFO L87 Difference]: Start difference. First operand 61 states and 148 transitions. Second operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:50,442 INFO L93 Difference]: Finished difference Result 236 states and 583 transitions. [2022-11-16 20:27:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-16 20:27:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 20:27:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:50,444 INFO L225 Difference]: With dead ends: 236 [2022-11-16 20:27:50,444 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 20:27:50,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3628 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3348, Invalid=7364, Unknown=0, NotChecked=0, Total=10712 [2022-11-16 20:27:50,449 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 503 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:50,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 0 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:27:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 20:27:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2022-11-16 20:27:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.484536082474227) internal successors, (241), 97 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 241 transitions. [2022-11-16 20:27:50,455 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 241 transitions. Word has length 24 [2022-11-16 20:27:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:50,455 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 241 transitions. [2022-11-16 20:27:50,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 241 transitions. [2022-11-16 20:27:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 20:27:50,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:50,457 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:50,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:50,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 310243907, now seen corresponding path program 10 times [2022-11-16 20:27:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:50,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8067493] [2022-11-16 20:27:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:51,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8067493] [2022-11-16 20:27:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8067493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003415010] [2022-11-16 20:27:51,624 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:27:51,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:51,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:51,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:51,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 20:27:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:51,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 20:27:51,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:51,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003415010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569521881] [2022-11-16 20:27:53,088 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-16 20:27:53,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:53,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2022-11-16 20:27:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136606338] [2022-11-16 20:27:53,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:53,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 20:27:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 20:27:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=3278, Unknown=0, NotChecked=0, Total=4290 [2022-11-16 20:27:53,095 INFO L87 Difference]: Start difference. First operand 98 states and 241 transitions. Second operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:55,183 INFO L93 Difference]: Finished difference Result 267 states and 583 transitions. [2022-11-16 20:27:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 20:27:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 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 38 [2022-11-16 20:27:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:55,186 INFO L225 Difference]: With dead ends: 267 [2022-11-16 20:27:55,186 INFO L226 Difference]: Without dead ends: 235 [2022-11-16 20:27:55,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5362 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5034, Invalid=11996, Unknown=0, NotChecked=0, Total=17030 [2022-11-16 20:27:55,192 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 391 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:55,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:27:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-16 20:27:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 110. [2022-11-16 20:27:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.467889908256881) internal successors, (269), 109 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 269 transitions. [2022-11-16 20:27:55,199 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 269 transitions. Word has length 38 [2022-11-16 20:27:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:55,199 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 269 transitions. [2022-11-16 20:27:55,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:27:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 269 transitions. [2022-11-16 20:27:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 20:27:55,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:55,201 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:55,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 20:27:55,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 20:27:55,408 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:27:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1507761175, now seen corresponding path program 11 times [2022-11-16 20:27:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:55,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772254921] [2022-11-16 20:27:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:56,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772254921] [2022-11-16 20:27:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772254921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997011308] [2022-11-16 20:27:56,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:56,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:56,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:56,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 20:27:56,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-11-16 20:27:56,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:27:56,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 20:27:56,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:27:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:56,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:27:57,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997011308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:27:57,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116515184] [2022-11-16 20:27:57,669 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-16 20:27:57,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:27:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2022-11-16 20:27:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203087544] [2022-11-16 20:27:57,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:57,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 20:27:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 20:27:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=3458, Unknown=0, NotChecked=0, Total=4290 [2022-11-16 20:27:57,672 INFO L87 Difference]: Start difference. First operand 110 states and 269 transitions. Second operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:00,020 INFO L93 Difference]: Finished difference Result 294 states and 645 transitions. [2022-11-16 20:28:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 20:28:00,021 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 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 38 [2022-11-16 20:28:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:00,022 INFO L225 Difference]: With dead ends: 294 [2022-11-16 20:28:00,022 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 20:28:00,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5086, Invalid=14096, Unknown=0, NotChecked=0, Total=19182 [2022-11-16 20:28:00,027 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 475 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:00,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:28:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 20:28:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 118. [2022-11-16 20:28:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 293 transitions. [2022-11-16 20:28:00,033 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 293 transitions. Word has length 38 [2022-11-16 20:28:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:00,034 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 293 transitions. [2022-11-16 20:28:00,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 293 transitions. [2022-11-16 20:28:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 20:28:00,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:00,036 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:00,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:28:00,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 20:28:00,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:28:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1326106935, now seen corresponding path program 12 times [2022-11-16 20:28:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:00,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83059812] [2022-11-16 20:28:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:01,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:01,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83059812] [2022-11-16 20:28:01,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83059812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989394275] [2022-11-16 20:28:01,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:28:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:01,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:01,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:28:01,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 20:28:01,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:28:01,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:28:01,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 20:28:01,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:01,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:28:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:02,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989394275] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:28:02,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1461467885] [2022-11-16 20:28:02,223 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-16 20:28:02,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:28:02,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2022-11-16 20:28:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091043892] [2022-11-16 20:28:02,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:28:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 20:28:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 20:28:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=3646, Unknown=0, NotChecked=0, Total=4290 [2022-11-16 20:28:02,227 INFO L87 Difference]: Start difference. First operand 118 states and 293 transitions. Second operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:04,874 INFO L93 Difference]: Finished difference Result 297 states and 661 transitions. [2022-11-16 20:28:04,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 20:28:04,875 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 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 38 [2022-11-16 20:28:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:04,877 INFO L225 Difference]: With dead ends: 297 [2022-11-16 20:28:04,877 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 20:28:04,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6063 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4856, Invalid=15450, Unknown=0, NotChecked=0, Total=20306 [2022-11-16 20:28:04,880 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 554 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:04,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 0 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:28:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 20:28:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 127. [2022-11-16 20:28:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.5476190476190474) internal successors, (321), 126 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 321 transitions. [2022-11-16 20:28:04,887 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 321 transitions. Word has length 38 [2022-11-16 20:28:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:04,887 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 321 transitions. [2022-11-16 20:28:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 321 transitions. [2022-11-16 20:28:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 20:28:04,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:04,889 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:04,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 20:28:05,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 20:28:05,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:28:05,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -88934047, now seen corresponding path program 13 times [2022-11-16 20:28:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:05,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238456416] [2022-11-16 20:28:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:05,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:05,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238456416] [2022-11-16 20:28:05,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238456416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:05,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179805921] [2022-11-16 20:28:05,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:28:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:05,876 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:28:05,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 20:28:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:05,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 20:28:06,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:06,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:28:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179805921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:28:06,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76108156] [2022-11-16 20:28:06,957 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-16 20:28:06,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:28:06,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2022-11-16 20:28:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898386548] [2022-11-16 20:28:06,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:28:06,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 20:28:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 20:28:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=3527, Unknown=0, NotChecked=0, Total=4290 [2022-11-16 20:28:06,961 INFO L87 Difference]: Start difference. First operand 127 states and 321 transitions. Second operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:09,663 INFO L93 Difference]: Finished difference Result 273 states and 637 transitions. [2022-11-16 20:28:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 20:28:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 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 38 [2022-11-16 20:28:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:09,666 INFO L225 Difference]: With dead ends: 273 [2022-11-16 20:28:09,666 INFO L226 Difference]: Without dead ends: 229 [2022-11-16 20:28:09,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6180 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5159, Invalid=15147, Unknown=0, NotChecked=0, Total=20306 [2022-11-16 20:28:09,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 789 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:09,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 0 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:28:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-16 20:28:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 140. [2022-11-16 20:28:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.6115107913669067) internal successors, (363), 139 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 363 transitions. [2022-11-16 20:28:09,675 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 363 transitions. Word has length 38 [2022-11-16 20:28:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:09,676 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 363 transitions. [2022-11-16 20:28:09,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 363 transitions. [2022-11-16 20:28:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 20:28:09,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:09,677 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:09,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 20:28:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:09,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:28:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2037403435, now seen corresponding path program 14 times [2022-11-16 20:28:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325588344] [2022-11-16 20:28:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:10,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325588344] [2022-11-16 20:28:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325588344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322017667] [2022-11-16 20:28:10,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:28:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:10,712 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:28:10,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 20:28:10,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-11-16 20:28:10,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:28:10,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 20:28:10,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:10,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:28:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322017667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:28:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605427285] [2022-11-16 20:28:11,816 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-16 20:28:11,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:28:11,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2022-11-16 20:28:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971719198] [2022-11-16 20:28:11,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:28:11,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 20:28:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 20:28:11,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=3688, Unknown=0, NotChecked=0, Total=4830 [2022-11-16 20:28:11,819 INFO L87 Difference]: Start difference. First operand 140 states and 363 transitions. Second operand has 70 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:14,644 INFO L93 Difference]: Finished difference Result 206 states and 515 transitions. [2022-11-16 20:28:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 20:28:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 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 40 [2022-11-16 20:28:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:14,646 INFO L225 Difference]: With dead ends: 206 [2022-11-16 20:28:14,646 INFO L226 Difference]: Without dead ends: 156 [2022-11-16 20:28:14,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6920 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6286, Invalid=15470, Unknown=0, NotChecked=0, Total=21756 [2022-11-16 20:28:14,648 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 661 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:14,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 0 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:28:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-16 20:28:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-11-16 20:28:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.480769230769231) internal successors, (258), 104 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 258 transitions. [2022-11-16 20:28:14,654 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 258 transitions. Word has length 40 [2022-11-16 20:28:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:14,655 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 258 transitions. [2022-11-16 20:28:14,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 258 transitions. [2022-11-16 20:28:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 20:28:14,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:14,656 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:14,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 20:28:14,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 20:28:14,863 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:28:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -630337315, now seen corresponding path program 15 times [2022-11-16 20:28:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:14,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087305590] [2022-11-16 20:28:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:15,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:15,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087305590] [2022-11-16 20:28:15,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087305590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:15,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897043929] [2022-11-16 20:28:15,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:28:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:15,989 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:28:16,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 20:28:16,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:28:16,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:28:16,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 20:28:16,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:16,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:28:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:28:16,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897043929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:28:16,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1251602114] [2022-11-16 20:28:16,971 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-16 20:28:16,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:28:16,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 47 [2022-11-16 20:28:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850756754] [2022-11-16 20:28:16,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:28:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 20:28:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 20:28:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1822, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 20:28:16,974 INFO L87 Difference]: Start difference. First operand 105 states and 258 transitions. Second operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:19,878 INFO L93 Difference]: Finished difference Result 228 states and 563 transitions. [2022-11-16 20:28:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-16 20:28:19,878 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-16 20:28:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:19,879 INFO L225 Difference]: With dead ends: 228 [2022-11-16 20:28:19,879 INFO L226 Difference]: Without dead ends: 197 [2022-11-16 20:28:19,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 49 SyntacticMatches, 34 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6395 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5577, Invalid=12245, Unknown=0, NotChecked=0, Total=17822 [2022-11-16 20:28:19,881 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 593 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:19,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 0 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:28:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-16 20:28:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 118. [2022-11-16 20:28:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.4871794871794872) internal successors, (291), 117 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 291 transitions. [2022-11-16 20:28:19,887 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 291 transitions. Word has length 46 [2022-11-16 20:28:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:19,887 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 291 transitions. [2022-11-16 20:28:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:28:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 291 transitions. [2022-11-16 20:28:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 20:28:19,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:19,889 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:19,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 20:28:20,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 20:28:20,095 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 20:28:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2119342903, now seen corresponding path program 16 times [2022-11-16 20:28:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737115493] [2022-11-16 20:28:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:28:20,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:28:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:28:20,229 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:28:20,229 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:28:20,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-16 20:28:20,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-16 20:28:20,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-16 20:28:20,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 20:28:20,235 INFO L444 BasicCegarLoop]: Path program histogram: [16, 2, 1] [2022-11-16 20:28:20,241 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:28:20,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:28:20,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:28:20 BasicIcfg [2022-11-16 20:28:20,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:28:20,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:28:20,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:28:20,309 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:28:20,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:27:34" (3/4) ... [2022-11-16 20:28:20,312 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 20:28:20,399 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 20:28:20,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:28:20,400 INFO L158 Benchmark]: Toolchain (without parser) took 46916.12ms. Allocated memory was 111.1MB in the beginning and 209.7MB in the end (delta: 98.6MB). Free memory was 68.8MB in the beginning and 113.1MB in the end (delta: -44.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,401 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:28:20,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.96ms. Allocated memory is still 111.1MB. Free memory was 68.5MB in the beginning and 76.0MB in the end (delta: -7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,402 INFO L158 Benchmark]: Boogie Preprocessor took 24.76ms. Allocated memory is still 111.1MB. Free memory was 73.9MB in the beginning and 72.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:28:20,402 INFO L158 Benchmark]: RCFGBuilder took 450.07ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 60.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,403 INFO L158 Benchmark]: TraceAbstraction took 45727.44ms. Allocated memory was 111.1MB in the beginning and 209.7MB in the end (delta: 98.6MB). Free memory was 59.2MB in the beginning and 125.7MB in the end (delta: -66.5MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,403 INFO L158 Benchmark]: Witness Printer took 90.84ms. Allocated memory is still 209.7MB. Free memory was 125.7MB in the beginning and 113.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 20:28:20,405 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.96ms. Allocated memory is still 111.1MB. Free memory was 68.5MB in the beginning and 76.0MB in the end (delta: -7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.76ms. Allocated memory is still 111.1MB. Free memory was 73.9MB in the beginning and 72.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 450.07ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 60.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45727.44ms. Allocated memory was 111.1MB in the beginning and 209.7MB in the end (delta: 98.6MB). Free memory was 59.2MB in the beginning and 125.7MB in the end (delta: -66.5MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 90.84ms. Allocated memory is still 209.7MB. Free memory was 125.7MB in the beginning and 113.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 72 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 16 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 5 FixpointIterations, 21 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 62 TotalNumberOfCompositions, 1060 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 920, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 737, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 737, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 920, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 737, unknown conditional: 0, unknown unconditional: 737] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=3, id1={3:0}, id2={5:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=7, id1={3:0}, id2={5:0}, j=6, k=1, pthread_create(&id2, ((void *)0), t2, ((void *)0))=7] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, condI=0, i=7, id1={3:0}, id2={5:0}, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=12, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=16, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, condI=0, condJ=1, i=45, id1={3:0}, id2={5:0}, j=46, k=20, k=20] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5128 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5128 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1069 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4038 IncrementalHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1069 mSolverCounterUnsat, 0 mSDtfsCounter, 4038 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1607 GetRequests, 396 SyntacticMatches, 42 SemanticMatches, 1169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42893 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=16, InterpolantAutomatonStates: 729, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 976 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 788 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 4586 SizeOfPredicates, 240 NumberOfNonLiveVariables, 2650 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 44 InterpolantComputations, 5 PerfectInterpolantSequences, 15/4596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 20:28:20,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b9e577-af01-4d84-96be-02d44c879c05/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE