./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:25:14,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:25:14,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:25:14,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:25:14,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:25:14,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:25:14,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:25:14,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:25:14,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:25:14,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:25:14,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:25:14,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:25:14,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:25:14,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:25:14,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:25:14,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:25:14,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:25:14,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:25:14,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:25:14,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:25:14,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:25:14,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:25:14,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:25:14,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:25:14,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:25:14,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:25:14,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:25:14,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:25:14,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:25:14,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:25:14,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:25:14,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:25:14,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:25:14,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:25:14,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:25:14,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:25:14,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:25:14,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:25:14,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:25:14,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:25:14,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:25:14,261 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:25:14,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:25:14,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:25:14,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:25:14,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:25:14,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:25:14,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:25:14,308 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:25:14,308 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:25:14,308 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:25:14,309 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:25:14,310 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:25:14,310 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:25:14,310 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:25:14,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:25:14,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:25:14,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:25:14,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:25:14,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:25:14,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:25:14,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:25:14,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:25:14,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:25:14,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:25:14,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:25:14,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:25:14,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:25:14,316 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_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 [2022-11-25 23:25:14,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:25:14,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:25:14,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:25:14,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:25:14,666 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:25:14,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-11-25 23:25:17,877 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:25:18,226 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:25:18,226 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-11-25 23:25:18,257 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/data/69d405f73/1edbd4778c6d4a03844b62ecb10bc1ff/FLAG09d9019e1 [2022-11-25 23:25:18,282 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/data/69d405f73/1edbd4778c6d4a03844b62ecb10bc1ff [2022-11-25 23:25:18,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:25:18,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:25:18,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:25:18,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:25:18,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:25:18,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:18,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3490195b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18, skipping insertion in model container [2022-11-25 23:25:18,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:18,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:25:18,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:25:18,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-11-25 23:25:18,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:25:18,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:25:18,947 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-11-25 23:25:18,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:25:18,986 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:25:18,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18 WrapperNode [2022-11-25 23:25:18,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:25:18,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:25:18,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:25:18,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:25:18,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,026 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2022-11-25 23:25:19,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:25:19,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:25:19,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:25:19,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:25:19,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:25:19,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:25:19,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:25:19,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:25:19,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (1/1) ... [2022-11-25 23:25:19,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:25:19,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:25:19,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:25:19,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:25:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:25:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 23:25:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 23:25:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:25:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:25:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:25:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:25:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:25:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:25:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:25:19,144 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:25:19,299 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:25:19,302 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:25:19,503 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:25:19,582 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:25:19,587 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:25:19,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:25:19 BoogieIcfgContainer [2022-11-25 23:25:19,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:25:19,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:25:19,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:25:19,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:25:19,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:25:18" (1/3) ... [2022-11-25 23:25:19,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca72251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:25:19, skipping insertion in model container [2022-11-25 23:25:19,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:25:18" (2/3) ... [2022-11-25 23:25:19,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca72251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:25:19, skipping insertion in model container [2022-11-25 23:25:19,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:25:19" (3/3) ... [2022-11-25 23:25:19,602 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2022-11-25 23:25:19,613 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:25:19,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:25:19,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:25:19,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:25:19,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:25:19,758 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:25:19,782 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 85 transitions, 175 flow [2022-11-25 23:25:19,793 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 85 transitions, 175 flow [2022-11-25 23:25:19,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 175 flow [2022-11-25 23:25:19,874 INFO L130 PetriNetUnfolder]: 9/96 cut-off events. [2022-11-25 23:25:19,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 23:25:19,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 96 events. 9/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-11-25 23:25:19,882 INFO L119 LiptonReduction]: Number of co-enabled transitions 1316 [2022-11-25 23:25:23,537 INFO L134 LiptonReduction]: Checked pairs total: 1146 [2022-11-25 23:25:23,538 INFO L136 LiptonReduction]: Total number of compositions: 92 [2022-11-25 23:25:23,546 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 12 places, 10 transitions, 25 flow [2022-11-25 23:25:23,558 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:25:23,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:25:23,583 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;@6e0ab5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:25:23,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-25 23:25:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:25:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:25:23,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:23,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:25:23,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:25:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 407281618, now seen corresponding path program 1 times [2022-11-25 23:25:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:23,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570988271] [2022-11-25 23:25:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:23,823 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-25 23:25:23,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570988271] [2022-11-25 23:25:23,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570988271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:23,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:25:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142919859] [2022-11-25 23:25:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:23,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:25:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:25:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:23,880 INFO L87 Difference]: Start difference. First operand has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-25 23:25:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:23,921 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2022-11-25 23:25:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:25:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-25 23:25:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:23,932 INFO L225 Difference]: With dead ends: 15 [2022-11-25 23:25:23,933 INFO L226 Difference]: Without dead ends: 15 [2022-11-25 23:25:23,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:23,939 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:23,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-25 23:25:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-25 23:25:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 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-25 23:25:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2022-11-25 23:25:23,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 5 [2022-11-25 23:25:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:23,977 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2022-11-25 23:25:23,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-25 23:25:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2022-11-25 23:25:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:25:23,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:23,982 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 23:25:23,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:25:23,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:25:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -259236804, now seen corresponding path program 1 times [2022-11-25 23:25:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:23,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372581523] [2022-11-25 23:25:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:24,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:25:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:24,099 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:25:24,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:25:24,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2022-11-25 23:25:24,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-11-25 23:25:24,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-11-25 23:25:24,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:25:24,115 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 23:25:24,118 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 23:25:24,119 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 23:25:24,182 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:25:24,195 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:25:24,195 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 133 transitions, 278 flow [2022-11-25 23:25:24,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 133 transitions, 278 flow [2022-11-25 23:25:24,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2022-11-25 23:25:24,249 INFO L130 PetriNetUnfolder]: 17/157 cut-off events. [2022-11-25 23:25:24,258 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 23:25:24,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 17/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 279 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2022-11-25 23:25:24,270 INFO L119 LiptonReduction]: Number of co-enabled transitions 7144 [2022-11-25 23:25:28,059 INFO L134 LiptonReduction]: Checked pairs total: 9946 [2022-11-25 23:25:28,061 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-25 23:25:28,063 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 32 transitions, 76 flow [2022-11-25 23:25:28,143 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 532 states, 524 states have (on average 3.437022900763359) internal successors, (1801), 531 states have internal predecessors, (1801), 0 states have call successors, (0), 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-25 23:25:28,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:25:28,145 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;@6e0ab5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:25:28,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 23:25:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 524 states have (on average 3.437022900763359) internal successors, (1801), 531 states have internal predecessors, (1801), 0 states have call successors, (0), 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-25 23:25:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:25:28,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:28,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:25:28,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 23:25:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash 135001205, now seen corresponding path program 1 times [2022-11-25 23:25:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:28,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987186200] [2022-11-25 23:25:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:28,195 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-25 23:25:28,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987186200] [2022-11-25 23:25:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987186200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:28,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:28,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:25:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664498386] [2022-11-25 23:25:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:28,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:25:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:28,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:25:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:28,200 INFO L87 Difference]: Start difference. First operand has 532 states, 524 states have (on average 3.437022900763359) internal successors, (1801), 531 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:28,264 INFO L93 Difference]: Finished difference Result 444 states and 1303 transitions. [2022-11-25 23:25:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:25:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:28,272 INFO L225 Difference]: With dead ends: 444 [2022-11-25 23:25:28,273 INFO L226 Difference]: Without dead ends: 444 [2022-11-25 23:25:28,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:28,274 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:28,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-25 23:25:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-11-25 23:25:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 440 states have (on average 2.9613636363636364) internal successors, (1303), 443 states have internal predecessors, (1303), 0 states have call successors, (0), 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-25 23:25:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1303 transitions. [2022-11-25 23:25:28,317 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1303 transitions. Word has length 6 [2022-11-25 23:25:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:28,317 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 1303 transitions. [2022-11-25 23:25:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1303 transitions. [2022-11-25 23:25:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:25:28,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:28,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:25:28,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 23:25:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1680078959, now seen corresponding path program 1 times [2022-11-25 23:25:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:28,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106017126] [2022-11-25 23:25:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:28,407 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-25 23:25:28,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:28,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106017126] [2022-11-25 23:25:28,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106017126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:28,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:28,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879054492] [2022-11-25 23:25:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:28,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:28,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:28,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:28,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:28,411 INFO L87 Difference]: Start difference. First operand 444 states and 1303 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:28,490 INFO L93 Difference]: Finished difference Result 493 states and 1442 transitions. [2022-11-25 23:25:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-25 23:25:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:28,496 INFO L225 Difference]: With dead ends: 493 [2022-11-25 23:25:28,500 INFO L226 Difference]: Without dead ends: 493 [2022-11-25 23:25:28,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:28,503 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:28,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-11-25 23:25:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2022-11-25 23:25:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 489 states have (on average 2.948875255623722) internal successors, (1442), 492 states have internal predecessors, (1442), 0 states have call successors, (0), 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-25 23:25:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1442 transitions. [2022-11-25 23:25:28,564 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1442 transitions. Word has length 9 [2022-11-25 23:25:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:28,565 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1442 transitions. [2022-11-25 23:25:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1442 transitions. [2022-11-25 23:25:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:25:28,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:28,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:25:28,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 23:25:28,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2049245249, now seen corresponding path program 1 times [2022-11-25 23:25:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:28,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839394658] [2022-11-25 23:25:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:25:28,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839394658] [2022-11-25 23:25:28,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839394658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:28,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257430789] [2022-11-25 23:25:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:28,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:28,658 INFO L87 Difference]: Start difference. First operand 493 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:28,718 INFO L93 Difference]: Finished difference Result 520 states and 1464 transitions. [2022-11-25 23:25:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:28,723 INFO L225 Difference]: With dead ends: 520 [2022-11-25 23:25:28,723 INFO L226 Difference]: Without dead ends: 520 [2022-11-25 23:25:28,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:28,725 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:28,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-11-25 23:25:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 495. [2022-11-25 23:25:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 491 states have (on average 2.90020366598778) internal successors, (1424), 494 states have internal predecessors, (1424), 0 states have call successors, (0), 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-25 23:25:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1424 transitions. [2022-11-25 23:25:28,751 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1424 transitions. Word has length 10 [2022-11-25 23:25:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:28,751 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 1424 transitions. [2022-11-25 23:25:28,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1424 transitions. [2022-11-25 23:25:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:25:28,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:28,753 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 23:25:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:25:28,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 23:25:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1605199982, now seen corresponding path program 1 times [2022-11-25 23:25:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:28,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558420343] [2022-11-25 23:25:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:28,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:25:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:28,787 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:25:28,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:25:28,788 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-25 23:25:28,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-25 23:25:28,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-25 23:25:28,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-25 23:25:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:25:28,790 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-25 23:25:28,790 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 23:25:28,790 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 23:25:28,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:25:28,823 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:25:28,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 181 transitions, 383 flow [2022-11-25 23:25:28,824 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 181 transitions, 383 flow [2022-11-25 23:25:28,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 181 transitions, 383 flow [2022-11-25 23:25:28,873 INFO L130 PetriNetUnfolder]: 25/218 cut-off events. [2022-11-25 23:25:28,873 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 23:25:28,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 218 events. 25/218 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 523 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2022-11-25 23:25:28,889 INFO L119 LiptonReduction]: Number of co-enabled transitions 17484 [2022-11-25 23:25:33,718 INFO L134 LiptonReduction]: Checked pairs total: 24972 [2022-11-25 23:25:33,719 INFO L136 LiptonReduction]: Total number of compositions: 168 [2022-11-25 23:25:33,720 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 45 transitions, 111 flow [2022-11-25 23:25:33,992 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4824 states, 4805 states have (on average 4.728199791883455) internal successors, (22719), 4823 states have internal predecessors, (22719), 0 states have call successors, (0), 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-25 23:25:33,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:25:33,999 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;@6e0ab5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:25:33,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 23:25:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 4824 states, 4805 states have (on average 4.728199791883455) internal successors, (22719), 4823 states have internal predecessors, (22719), 0 states have call successors, (0), 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-25 23:25:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:25:34,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:34,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:25:34,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1042627277, now seen corresponding path program 1 times [2022-11-25 23:25:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982723870] [2022-11-25 23:25:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:34,078 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-25 23:25:34,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982723870] [2022-11-25 23:25:34,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982723870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:34,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:34,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:25:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032292360] [2022-11-25 23:25:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:25:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:25:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:34,101 INFO L87 Difference]: Start difference. First operand has 4824 states, 4805 states have (on average 4.728199791883455) internal successors, (22719), 4823 states have internal predecessors, (22719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:34,207 INFO L93 Difference]: Finished difference Result 4008 states and 16189 transitions. [2022-11-25 23:25:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:25:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:34,248 INFO L225 Difference]: With dead ends: 4008 [2022-11-25 23:25:34,248 INFO L226 Difference]: Without dead ends: 4008 [2022-11-25 23:25:34,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:34,251 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:34,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2022-11-25 23:25:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 4008. [2022-11-25 23:25:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4000 states have (on average 4.04725) internal successors, (16189), 4007 states have internal predecessors, (16189), 0 states have call successors, (0), 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-25 23:25:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 16189 transitions. [2022-11-25 23:25:34,472 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 16189 transitions. Word has length 6 [2022-11-25 23:25:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:34,472 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 16189 transitions. [2022-11-25 23:25:34,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 16189 transitions. [2022-11-25 23:25:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:25:34,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:34,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:34,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:25:34,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:34,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 237607164, now seen corresponding path program 1 times [2022-11-25 23:25:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:34,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629729164] [2022-11-25 23:25:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:34,583 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-25 23:25:34,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:34,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629729164] [2022-11-25 23:25:34,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629729164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:34,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:34,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:34,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030980687] [2022-11-25 23:25:34,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:34,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:34,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:34,586 INFO L87 Difference]: Start difference. First operand 4008 states and 16189 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:34,791 INFO L93 Difference]: Finished difference Result 4453 states and 17938 transitions. [2022-11-25 23:25:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:34,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-25 23:25:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:34,841 INFO L225 Difference]: With dead ends: 4453 [2022-11-25 23:25:34,841 INFO L226 Difference]: Without dead ends: 4453 [2022-11-25 23:25:34,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:34,952 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:34,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2022-11-25 23:25:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2022-11-25 23:25:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4445 states have (on average 4.035545556805399) internal successors, (17938), 4452 states have internal predecessors, (17938), 0 states have call successors, (0), 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-25 23:25:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 17938 transitions. [2022-11-25 23:25:35,172 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 17938 transitions. Word has length 9 [2022-11-25 23:25:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 4453 states and 17938 transitions. [2022-11-25 23:25:35,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 17938 transitions. [2022-11-25 23:25:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:25:35,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:35,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:35,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:25:35,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 997788469, now seen corresponding path program 1 times [2022-11-25 23:25:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:35,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775465190] [2022-11-25 23:25:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:25:35,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775465190] [2022-11-25 23:25:35,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775465190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:35,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:35,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885808675] [2022-11-25 23:25:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:35,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:35,327 INFO L87 Difference]: Start difference. First operand 4453 states and 17938 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:35,528 INFO L93 Difference]: Finished difference Result 5288 states and 20600 transitions. [2022-11-25 23:25:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:35,605 INFO L225 Difference]: With dead ends: 5288 [2022-11-25 23:25:35,605 INFO L226 Difference]: Without dead ends: 5288 [2022-11-25 23:25:35,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:35,608 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:35,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2022-11-25 23:25:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4943. [2022-11-25 23:25:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4935 states have (on average 3.980547112462006) internal successors, (19644), 4942 states have internal predecessors, (19644), 0 states have call successors, (0), 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-25 23:25:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 19644 transitions. [2022-11-25 23:25:35,936 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 19644 transitions. Word has length 10 [2022-11-25 23:25:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:35,936 INFO L495 AbstractCegarLoop]: Abstraction has 4943 states and 19644 transitions. [2022-11-25 23:25:35,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 19644 transitions. [2022-11-25 23:25:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:25:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:35,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:35,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:25:35,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 224048210, now seen corresponding path program 1 times [2022-11-25 23:25:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:35,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578037296] [2022-11-25 23:25:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:25:36,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:36,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578037296] [2022-11-25 23:25:36,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578037296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:36,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:36,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952724256] [2022-11-25 23:25:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:36,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:36,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:36,031 INFO L87 Difference]: Start difference. First operand 4943 states and 19644 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-25 23:25:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:36,171 INFO L93 Difference]: Finished difference Result 5435 states and 21557 transitions. [2022-11-25 23:25:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 13 [2022-11-25 23:25:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:36,222 INFO L225 Difference]: With dead ends: 5435 [2022-11-25 23:25:36,222 INFO L226 Difference]: Without dead ends: 5435 [2022-11-25 23:25:36,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:36,223 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:36,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2022-11-25 23:25:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 5435. [2022-11-25 23:25:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5427 states have (on average 3.9721761562557583) internal successors, (21557), 5434 states have internal predecessors, (21557), 0 states have call successors, (0), 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-25 23:25:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 21557 transitions. [2022-11-25 23:25:36,534 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 21557 transitions. Word has length 13 [2022-11-25 23:25:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:36,534 INFO L495 AbstractCegarLoop]: Abstraction has 5435 states and 21557 transitions. [2022-11-25 23:25:36,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-25 23:25:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 21557 transitions. [2022-11-25 23:25:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:25:36,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:36,536 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:36,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:25:36,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1078932845, now seen corresponding path program 1 times [2022-11-25 23:25:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191316907] [2022-11-25 23:25:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:25:36,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191316907] [2022-11-25 23:25:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191316907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:36,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:36,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124659706] [2022-11-25 23:25:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:36,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:36,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:36,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:36,605 INFO L87 Difference]: Start difference. First operand 5435 states and 21557 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:25:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:36,842 INFO L93 Difference]: Finished difference Result 6119 states and 23450 transitions. [2022-11-25 23:25:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:25:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:36,877 INFO L225 Difference]: With dead ends: 6119 [2022-11-25 23:25:36,877 INFO L226 Difference]: Without dead ends: 6119 [2022-11-25 23:25:36,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:36,878 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:36,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2022-11-25 23:25:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 5747. [2022-11-25 23:25:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 5739 states have (on average 3.91130859034675) internal successors, (22447), 5746 states have internal predecessors, (22447), 0 states have call successors, (0), 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-25 23:25:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 22447 transitions. [2022-11-25 23:25:37,210 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 22447 transitions. Word has length 14 [2022-11-25 23:25:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:37,211 INFO L495 AbstractCegarLoop]: Abstraction has 5747 states and 22447 transitions. [2022-11-25 23:25:37,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:25:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 22447 transitions. [2022-11-25 23:25:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:25:37,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:37,213 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-25 23:25:37,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:25:37,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 23:25:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1075836994, now seen corresponding path program 1 times [2022-11-25 23:25:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:37,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648129088] [2022-11-25 23:25:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:37,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:25:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:25:37,247 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:25:37,247 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:25:37,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-25 23:25:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 23:25:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-25 23:25:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-25 23:25:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 23:25:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:25:37,250 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-25 23:25:37,250 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 23:25:37,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-25 23:25:37,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:25:37,293 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:25:37,294 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 229 transitions, 490 flow [2022-11-25 23:25:37,294 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 229 transitions, 490 flow [2022-11-25 23:25:37,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 229 transitions, 490 flow [2022-11-25 23:25:37,369 INFO L130 PetriNetUnfolder]: 33/279 cut-off events. [2022-11-25 23:25:37,369 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 23:25:37,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 279 events. 33/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 795 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 226. Up to 10 conditions per place. [2022-11-25 23:25:37,398 INFO L119 LiptonReduction]: Number of co-enabled transitions 32336 [2022-11-25 23:25:43,265 INFO L134 LiptonReduction]: Checked pairs total: 45142 [2022-11-25 23:25:43,265 INFO L136 LiptonReduction]: Total number of compositions: 211 [2022-11-25 23:25:43,267 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 58 transitions, 148 flow [2022-11-25 23:25:45,223 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 43460 states, 43418 states have (on average 6.047054217144963) internal successors, (262551), 43459 states have internal predecessors, (262551), 0 states have call successors, (0), 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-25 23:25:45,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:25:45,226 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;@6e0ab5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:25:45,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 23:25:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 43460 states, 43418 states have (on average 6.047054217144963) internal successors, (262551), 43459 states have internal predecessors, (262551), 0 states have call successors, (0), 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-25 23:25:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:25:45,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:45,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:25:45,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:25:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 424770028, now seen corresponding path program 1 times [2022-11-25 23:25:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:45,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792256669] [2022-11-25 23:25:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:45,342 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-25 23:25:45,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792256669] [2022-11-25 23:25:45,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792256669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:45,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:45,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:25:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787599350] [2022-11-25 23:25:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:25:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:25:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:45,605 INFO L87 Difference]: Start difference. First operand has 43460 states, 43418 states have (on average 6.047054217144963) internal successors, (262551), 43459 states have internal predecessors, (262551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:46,396 INFO L93 Difference]: Finished difference Result 36084 states and 185803 transitions. [2022-11-25 23:25:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:25:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:47,237 INFO L225 Difference]: With dead ends: 36084 [2022-11-25 23:25:47,251 INFO L226 Difference]: Without dead ends: 36084 [2022-11-25 23:25:47,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:25:47,252 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:47,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:25:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36084 states. [2022-11-25 23:25:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36084 to 36084. [2022-11-25 23:25:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36084 states, 36068 states have (on average 5.151463901519352) internal successors, (185803), 36083 states have internal predecessors, (185803), 0 states have call successors, (0), 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-25 23:25:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36084 states to 36084 states and 185803 transitions. [2022-11-25 23:25:50,063 INFO L78 Accepts]: Start accepts. Automaton has 36084 states and 185803 transitions. Word has length 6 [2022-11-25 23:25:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:50,063 INFO L495 AbstractCegarLoop]: Abstraction has 36084 states and 185803 transitions. [2022-11-25 23:25:50,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-25 23:25:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 36084 states and 185803 transitions. [2022-11-25 23:25:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:25:50,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:50,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:25:50,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:25:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1262622909, now seen corresponding path program 1 times [2022-11-25 23:25:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:50,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142442217] [2022-11-25 23:25:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:50,115 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-25 23:25:50,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142442217] [2022-11-25 23:25:50,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142442217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:50,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:50,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745838319] [2022-11-25 23:25:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:50,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:50,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:50,118 INFO L87 Difference]: Start difference. First operand 36084 states and 185803 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:50,939 INFO L93 Difference]: Finished difference Result 40093 states and 206002 transitions. [2022-11-25 23:25:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-25 23:25:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:51,334 INFO L225 Difference]: With dead ends: 40093 [2022-11-25 23:25:51,334 INFO L226 Difference]: Without dead ends: 40093 [2022-11-25 23:25:51,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:51,335 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:51,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 64 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40093 states. [2022-11-25 23:25:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40093 to 40093. [2022-11-25 23:25:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40093 states, 40077 states have (on average 5.140155201237618) internal successors, (206002), 40092 states have internal predecessors, (206002), 0 states have call successors, (0), 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-25 23:25:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40093 states to 40093 states and 206002 transitions. [2022-11-25 23:25:53,977 INFO L78 Accepts]: Start accepts. Automaton has 40093 states and 206002 transitions. Word has length 9 [2022-11-25 23:25:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:53,978 INFO L495 AbstractCegarLoop]: Abstraction has 40093 states and 206002 transitions. [2022-11-25 23:25:53,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 23:25:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40093 states and 206002 transitions. [2022-11-25 23:25:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:25:53,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:53,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:25:53,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:25:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -878120753, now seen corresponding path program 1 times [2022-11-25 23:25:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:53,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513076667] [2022-11-25 23:25:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:25:54,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:54,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513076667] [2022-11-25 23:25:54,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513076667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:54,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:54,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745974364] [2022-11-25 23:25:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:54,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:54,024 INFO L87 Difference]: Start difference. First operand 40093 states and 206002 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:55,143 INFO L93 Difference]: Finished difference Result 50100 states and 250994 transitions. [2022-11-25 23:25:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:25:55,568 INFO L225 Difference]: With dead ends: 50100 [2022-11-25 23:25:55,568 INFO L226 Difference]: Without dead ends: 50100 [2022-11-25 23:25:55,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:55,569 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:25:55,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 39 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:25:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50100 states. [2022-11-25 23:25:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50100 to 46495. [2022-11-25 23:25:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46495 states, 46479 states have (on average 5.09477398394974) internal successors, (236800), 46494 states have internal predecessors, (236800), 0 states have call successors, (0), 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-25 23:25:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46495 states to 46495 states and 236800 transitions. [2022-11-25 23:25:58,570 INFO L78 Accepts]: Start accepts. Automaton has 46495 states and 236800 transitions. Word has length 10 [2022-11-25 23:25:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:25:58,571 INFO L495 AbstractCegarLoop]: Abstraction has 46495 states and 236800 transitions. [2022-11-25 23:25:58,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-25 23:25:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 46495 states and 236800 transitions. [2022-11-25 23:25:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:25:58,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:25:58,572 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:25:58,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:25:58,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:25:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:25:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2067357018, now seen corresponding path program 1 times [2022-11-25 23:25:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:25:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497680100] [2022-11-25 23:25:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:25:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:25:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:25:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:25:58,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:25:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497680100] [2022-11-25 23:25:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497680100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:25:58,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:25:58,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:25:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826894543] [2022-11-25 23:25:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:25:58,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:25:58,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:25:58,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:25:58,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:25:58,620 INFO L87 Difference]: Start difference. First operand 46495 states and 236800 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-25 23:25:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:25:59,251 INFO L93 Difference]: Finished difference Result 51435 states and 261381 transitions. [2022-11-25 23:25:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:25:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 13 [2022-11-25 23:25:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:26:00,288 INFO L225 Difference]: With dead ends: 51435 [2022-11-25 23:26:00,289 INFO L226 Difference]: Without dead ends: 51435 [2022-11-25 23:26:00,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:00,292 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:26:00,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 64 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:26:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51435 states. [2022-11-25 23:26:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51435 to 51435. [2022-11-25 23:26:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51435 states, 51419 states have (on average 5.083354402069274) internal successors, (261381), 51434 states have internal predecessors, (261381), 0 states have call successors, (0), 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-25 23:26:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51435 states to 51435 states and 261381 transitions. [2022-11-25 23:26:02,350 INFO L78 Accepts]: Start accepts. Automaton has 51435 states and 261381 transitions. Word has length 13 [2022-11-25 23:26:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:26:02,350 INFO L495 AbstractCegarLoop]: Abstraction has 51435 states and 261381 transitions. [2022-11-25 23:26:02,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-25 23:26:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 51435 states and 261381 transitions. [2022-11-25 23:26:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:26:02,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:26:02,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:26:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:26:02,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:26:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:26:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1288353216, now seen corresponding path program 1 times [2022-11-25 23:26:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:26:02,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504282827] [2022-11-25 23:26:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:26:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:26:02,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:26:02,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504282827] [2022-11-25 23:26:02,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504282827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:26:02,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:26:02,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:26:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153488935] [2022-11-25 23:26:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:26:02,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:26:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:26:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:26:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:02,393 INFO L87 Difference]: Start difference. First operand 51435 states and 261381 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:26:04,130 INFO L93 Difference]: Finished difference Result 62955 states and 311600 transitions. [2022-11-25 23:26:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:26:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:26:04,598 INFO L225 Difference]: With dead ends: 62955 [2022-11-25 23:26:04,599 INFO L226 Difference]: Without dead ends: 62955 [2022-11-25 23:26:04,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:04,599 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:26:04,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:26:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62955 states. [2022-11-25 23:26:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62955 to 58515. [2022-11-25 23:26:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58515 states, 58499 states have (on average 5.03254756491564) internal successors, (294399), 58514 states have internal predecessors, (294399), 0 states have call successors, (0), 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-25 23:26:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58515 states to 58515 states and 294399 transitions. [2022-11-25 23:26:08,175 INFO L78 Accepts]: Start accepts. Automaton has 58515 states and 294399 transitions. Word has length 14 [2022-11-25 23:26:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:26:08,176 INFO L495 AbstractCegarLoop]: Abstraction has 58515 states and 294399 transitions. [2022-11-25 23:26:08,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 58515 states and 294399 transitions. [2022-11-25 23:26:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:26:08,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:26:08,179 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:26:08,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:26:08,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:26:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:26:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash -841098274, now seen corresponding path program 1 times [2022-11-25 23:26:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:26:08,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721815767] [2022-11-25 23:26:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:08,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:26:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:26:08,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:26:08,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721815767] [2022-11-25 23:26:08,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721815767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:26:08,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:26:08,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:26:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392503683] [2022-11-25 23:26:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:26:08,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:26:08,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:26:08,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:26:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:08,229 INFO L87 Difference]: Start difference. First operand 58515 states and 294399 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:26:09,795 INFO L93 Difference]: Finished difference Result 64227 states and 322487 transitions. [2022-11-25 23:26:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:26:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:26:10,353 INFO L225 Difference]: With dead ends: 64227 [2022-11-25 23:26:10,353 INFO L226 Difference]: Without dead ends: 64227 [2022-11-25 23:26:10,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:10,354 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 35 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:26:10,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:26:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64227 states. [2022-11-25 23:26:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64227 to 64227. [2022-11-25 23:26:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64227 states, 64211 states have (on average 5.022301474825186) internal successors, (322487), 64226 states have internal predecessors, (322487), 0 states have call successors, (0), 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-25 23:26:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64227 states to 64227 states and 322487 transitions. [2022-11-25 23:26:14,295 INFO L78 Accepts]: Start accepts. Automaton has 64227 states and 322487 transitions. Word has length 17 [2022-11-25 23:26:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:26:14,296 INFO L495 AbstractCegarLoop]: Abstraction has 64227 states and 322487 transitions. [2022-11-25 23:26:14,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-25 23:26:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 64227 states and 322487 transitions. [2022-11-25 23:26:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:26:14,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:26:14,300 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:26:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:26:14,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:26:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:26:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1268159966, now seen corresponding path program 1 times [2022-11-25 23:26:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:26:14,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950568762] [2022-11-25 23:26:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:26:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:26:14,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:26:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950568762] [2022-11-25 23:26:14,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950568762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:26:14,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:26:14,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:26:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563553791] [2022-11-25 23:26:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:26:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:26:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:26:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:26:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:14,389 INFO L87 Difference]: Start difference. First operand 64227 states and 322487 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-25 23:26:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:26:15,268 INFO L93 Difference]: Finished difference Result 75675 states and 369557 transitions. [2022-11-25 23:26:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:26:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 18 [2022-11-25 23:26:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:26:15,728 INFO L225 Difference]: With dead ends: 75675 [2022-11-25 23:26:15,728 INFO L226 Difference]: Without dead ends: 75675 [2022-11-25 23:26:15,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:26:15,729 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:26:15,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 39 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:26:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75675 states. [2022-11-25 23:26:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75675 to 70563. [2022-11-25 23:26:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70563 states, 70547 states have (on average 4.962804938551604) internal successors, (350111), 70562 states have internal predecessors, (350111), 0 states have call successors, (0), 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-25 23:26:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70563 states to 70563 states and 350111 transitions. [2022-11-25 23:26:19,401 INFO L78 Accepts]: Start accepts. Automaton has 70563 states and 350111 transitions. Word has length 18 [2022-11-25 23:26:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:26:19,401 INFO L495 AbstractCegarLoop]: Abstraction has 70563 states and 350111 transitions. [2022-11-25 23:26:19,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-25 23:26:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 70563 states and 350111 transitions. [2022-11-25 23:26:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:26:19,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:26:19,406 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:26:19,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:26:19,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 23:26:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:26:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1976818250, now seen corresponding path program 1 times [2022-11-25 23:26:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:26:19,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259943268] [2022-11-25 23:26:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:26:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:26:19,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:26:19,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259943268] [2022-11-25 23:26:19,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259943268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:26:19,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833718500] [2022-11-25 23:26:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:26:19,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:26:19,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:26:19,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e840f806-1812-47f8-9afb-1374e9d9649c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:26:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:19,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:26:19,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:26:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:26:19,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:26:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:26:19,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833718500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:26:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954637835] [2022-11-25 23:26:19,782 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:26:19,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:26:19,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-25 23:26:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037813191] [2022-11-25 23:26:19,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:26:19,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:26:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:26:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:26:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:26:19,809 INFO L87 Difference]: Start difference. First operand 70563 states and 350111 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-25 23:26:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:26:22,160 INFO L93 Difference]: Finished difference Result 82551 states and 408912 transitions. [2022-11-25 23:26:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:26:22,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 19 [2022-11-25 23:26:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.