./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:13:11,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:13:11,429 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:13:11,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:13:11,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:13:11,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:13:11,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:13:11,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:13:11,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:13:11,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:13:11,465 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:13:11,466 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:13:11,467 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:13:11,467 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:13:11,468 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:13:11,468 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:13:11,469 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:13:11,470 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:13:11,470 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:13:11,471 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:13:11,471 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:13:11,472 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:13:11,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:13:11,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:13:11,474 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:13:11,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:13:11,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:13:11,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:13:11,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:13:11,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:13:11,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:13:11,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:13:11,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:13:11,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:13:11,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:13:11,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:13:11,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:13:11,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:13:11,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:13:11,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:13:11,479 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:13:11,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:13:11,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:13:11,488 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:13:11,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:13:11,488 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/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_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2023-11-12 00:13:11,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:13:11,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:13:11,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:13:11,804 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:13:11,805 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:13:11,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread/stack-2.i [2023-11-12 00:13:14,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:13:15,250 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:13:15,251 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/sv-benchmarks/c/pthread/stack-2.i [2023-11-12 00:13:15,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/data/fd6418b2c/d1d68f2f7eef40dcbb85343931c508ef/FLAGeb450fa56 [2023-11-12 00:13:15,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/data/fd6418b2c/d1d68f2f7eef40dcbb85343931c508ef [2023-11-12 00:13:15,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:13:15,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:13:15,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:13:15,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:13:15,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:13:15,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:13:15" (1/1) ... [2023-11-12 00:13:15,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83833c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:15, skipping insertion in model container [2023-11-12 00:13:15,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:13:15" (1/1) ... [2023-11-12 00:13:15,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:13:15,885 WARN L240 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_29a9faf3-096d-47b5-872b-2504e7bdf7e3/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2023-11-12 00:13:15,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:13:15,940 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:13:15,981 WARN L240 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_29a9faf3-096d-47b5-872b-2504e7bdf7e3/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2023-11-12 00:13:15,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:13:16,069 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:13:16,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16 WrapperNode [2023-11-12 00:13:16,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:13:16,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:13:16,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:13:16,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:13:16,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,167 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2023-11-12 00:13:16,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:13:16,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:13:16,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:13:16,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:13:16,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:13:16,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:13:16,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:13:16,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:13:16,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (1/1) ... [2023-11-12 00:13:16,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:13:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:16,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:13:16,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:13:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-12 00:13:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-12 00:13:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-12 00:13:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-12 00:13:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:13:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:13:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:13:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:13:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-12 00:13:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:13:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:13:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:13:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:13:16,338 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:13:16,533 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:13:16,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:13:16,811 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:13:16,821 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:13:16,821 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:13:16,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:13:16 BoogieIcfgContainer [2023-11-12 00:13:16,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:13:16,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:13:16,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:13:16,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:13:16,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:13:15" (1/3) ... [2023-11-12 00:13:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b8fe25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:13:16, skipping insertion in model container [2023-11-12 00:13:16,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:13:16" (2/3) ... [2023-11-12 00:13:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b8fe25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:13:16, skipping insertion in model container [2023-11-12 00:13:16,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:13:16" (3/3) ... [2023-11-12 00:13:16,834 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2023-11-12 00:13:16,844 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:13:16,857 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:13:16,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 00:13:16,858 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:13:16,973 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:13:17,037 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:13:17,058 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 170 transitions, 354 flow [2023-11-12 00:13:17,061 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 170 transitions, 354 flow [2023-11-12 00:13:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 354 flow [2023-11-12 00:13:17,173 INFO L124 PetriNetUnfolderBase]: 10/168 cut-off events. [2023-11-12 00:13:17,173 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 00:13:17,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 10/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 420 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2023-11-12 00:13:17,194 INFO L119 LiptonReduction]: Number of co-enabled transitions 8340 [2023-11-12 00:13:23,539 INFO L134 LiptonReduction]: Checked pairs total: 11571 [2023-11-12 00:13:23,539 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-11-12 00:13:23,549 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 37 transitions, 88 flow [2023-11-12 00:13:23,606 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 284 states, 281 states have (on average 2.7829181494661923) internal successors, (782), 283 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:23,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:13:23,633 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=LoopHeads, 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;@3b2c0d29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:13:23,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 00:13:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 281 states have (on average 2.7829181494661923) internal successors, (782), 283 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:13:23,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:23,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:13:23,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:23,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -832522784, now seen corresponding path program 1 times [2023-11-12 00:13:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372422702] [2023-11-12 00:13:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:24,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372422702] [2023-11-12 00:13:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372422702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:13:24,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231685924] [2023-11-12 00:13:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:24,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,116 INFO L87 Difference]: Start difference. First operand has 284 states, 281 states have (on average 2.7829181494661923) internal successors, (782), 283 states have internal predecessors, (782), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.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) [2023-11-12 00:13:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:24,294 INFO L93 Difference]: Finished difference Result 502 states and 1336 transitions. [2023-11-12 00:13:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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 [2023-11-12 00:13:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:24,327 INFO L225 Difference]: With dead ends: 502 [2023-11-12 00:13:24,327 INFO L226 Difference]: Without dead ends: 502 [2023-11-12 00:13:24,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,334 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:24,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-12 00:13:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 372. [2023-11-12 00:13:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.7913279132791327) internal successors, (1030), 371 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1030 transitions. [2023-11-12 00:13:24,442 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1030 transitions. Word has length 6 [2023-11-12 00:13:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:24,443 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 1030 transitions. [2023-11-12 00:13:24,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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) [2023-11-12 00:13:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1030 transitions. [2023-11-12 00:13:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:13:24,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:24,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:13:24,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:24,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -773034198, now seen corresponding path program 1 times [2023-11-12 00:13:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658207881] [2023-11-12 00:13:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:24,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658207881] [2023-11-12 00:13:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658207881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:24,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:24,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:13:24,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428691583] [2023-11-12 00:13:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,573 INFO L87 Difference]: Start difference. First operand 372 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:24,683 INFO L93 Difference]: Finished difference Result 450 states and 1202 transitions. [2023-11-12 00:13:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 00:13:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:24,688 INFO L225 Difference]: With dead ends: 450 [2023-11-12 00:13:24,689 INFO L226 Difference]: Without dead ends: 432 [2023-11-12 00:13:24,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,691 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:24,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-12 00:13:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 416. [2023-11-12 00:13:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 412 states have (on average 2.762135922330097) internal successors, (1138), 415 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1138 transitions. [2023-11-12 00:13:24,723 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1138 transitions. Word has length 8 [2023-11-12 00:13:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:24,724 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1138 transitions. [2023-11-12 00:13:24,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1138 transitions. [2023-11-12 00:13:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:13:24,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:24,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:13:24,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:24,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1229408026, now seen corresponding path program 1 times [2023-11-12 00:13:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:24,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643834941] [2023-11-12 00:13:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:24,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643834941] [2023-11-12 00:13:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643834941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:24,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:13:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675224060] [2023-11-12 00:13:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:24,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,811 INFO L87 Difference]: Start difference. First operand 416 states and 1138 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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) [2023-11-12 00:13:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:24,900 INFO L93 Difference]: Finished difference Result 446 states and 1219 transitions. [2023-11-12 00:13:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 [2023-11-12 00:13:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:24,905 INFO L225 Difference]: With dead ends: 446 [2023-11-12 00:13:24,905 INFO L226 Difference]: Without dead ends: 446 [2023-11-12 00:13:24,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:24,907 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:24,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-11-12 00:13:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2023-11-12 00:13:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 443 states have (on average 2.7516930022573365) internal successors, (1219), 445 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1219 transitions. [2023-11-12 00:13:24,932 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1219 transitions. Word has length 10 [2023-11-12 00:13:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:24,932 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1219 transitions. [2023-11-12 00:13:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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) [2023-11-12 00:13:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1219 transitions. [2023-11-12 00:13:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:13:24,934 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:24,935 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:24,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:13:24,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:24,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 955990432, now seen corresponding path program 1 times [2023-11-12 00:13:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109672380] [2023-11-12 00:13:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:25,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109672380] [2023-11-12 00:13:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109672380] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808924690] [2023-11-12 00:13:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:25,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:25,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:25,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:25,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:13:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:25,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:13:25,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:25,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808924690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:13:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1917323988] [2023-11-12 00:13:25,395 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-12 00:13:25,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:13:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-11-12 00:13:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77180043] [2023-11-12 00:13:25,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:25,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:13:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:13:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:13:25,404 INFO L87 Difference]: Start difference. First operand 446 states and 1219 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:25,841 INFO L93 Difference]: Finished difference Result 1090 states and 2879 transitions. [2023-11-12 00:13:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:13:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 [2023-11-12 00:13:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:25,851 INFO L225 Difference]: With dead ends: 1090 [2023-11-12 00:13:25,851 INFO L226 Difference]: Without dead ends: 1090 [2023-11-12 00:13:25,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:13:25,853 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:25,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:13:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-11-12 00:13:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 798. [2023-11-12 00:13:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 795 states have (on average 2.762264150943396) internal successors, (2196), 797 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2196 transitions. [2023-11-12 00:13:25,889 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2196 transitions. Word has length 14 [2023-11-12 00:13:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:25,890 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2196 transitions. [2023-11-12 00:13:25,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2196 transitions. [2023-11-12 00:13:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:13:25,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:25,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:25,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:26,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:26,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:26,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1061783306, now seen corresponding path program 1 times [2023-11-12 00:13:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265936618] [2023-11-12 00:13:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:26,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:26,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265936618] [2023-11-12 00:13:26,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265936618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:26,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:26,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:13:26,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760794466] [2023-11-12 00:13:26,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:26,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:13:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:13:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:13:26,262 INFO L87 Difference]: Start difference. First operand 798 states and 2196 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:26,354 INFO L93 Difference]: Finished difference Result 342 states and 792 transitions. [2023-11-12 00:13:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:13:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:13:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:26,358 INFO L225 Difference]: With dead ends: 342 [2023-11-12 00:13:26,358 INFO L226 Difference]: Without dead ends: 338 [2023-11-12 00:13:26,359 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 [2023-11-12 00:13:26,360 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:26,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-12 00:13:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 306. [2023-11-12 00:13:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 304 states have (on average 2.3026315789473686) internal successors, (700), 305 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 700 transitions. [2023-11-12 00:13:26,373 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 700 transitions. Word has length 16 [2023-11-12 00:13:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:26,373 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 700 transitions. [2023-11-12 00:13:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 700 transitions. [2023-11-12 00:13:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:13:26,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:26,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:26,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:13:26,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:26,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1834932017, now seen corresponding path program 1 times [2023-11-12 00:13:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672400954] [2023-11-12 00:13:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:26,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:26,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672400954] [2023-11-12 00:13:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672400954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:13:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284483589] [2023-11-12 00:13:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:26,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:13:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:13:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:13:26,491 INFO L87 Difference]: Start difference. First operand 306 states and 700 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:26,654 INFO L93 Difference]: Finished difference Result 432 states and 982 transitions. [2023-11-12 00:13:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:13:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 [2023-11-12 00:13:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:26,658 INFO L225 Difference]: With dead ends: 432 [2023-11-12 00:13:26,658 INFO L226 Difference]: Without dead ends: 432 [2023-11-12 00:13:26,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:13:26,659 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:26,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-12 00:13:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 340. [2023-11-12 00:13:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.3136094674556213) internal successors, (782), 339 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 782 transitions. [2023-11-12 00:13:26,674 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 782 transitions. Word has length 17 [2023-11-12 00:13:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:26,674 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 782 transitions. [2023-11-12 00:13:26,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 782 transitions. [2023-11-12 00:13:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:13:26,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:26,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:26,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:13:26,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:26,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:26,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1681082131, now seen corresponding path program 1 times [2023-11-12 00:13:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:26,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311619094] [2023-11-12 00:13:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:27,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:27,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311619094] [2023-11-12 00:13:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311619094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 00:13:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9734318] [2023-11-12 00:13:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:13:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:13:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-12 00:13:27,650 INFO L87 Difference]: Start difference. First operand 340 states and 782 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:28,798 INFO L93 Difference]: Finished difference Result 592 states and 1333 transitions. [2023-11-12 00:13:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:13:28,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-12 00:13:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:28,803 INFO L225 Difference]: With dead ends: 592 [2023-11-12 00:13:28,803 INFO L226 Difference]: Without dead ends: 592 [2023-11-12 00:13:28,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:13:28,804 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:28,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:13:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-11-12 00:13:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 452. [2023-11-12 00:13:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 450 states have (on average 2.368888888888889) internal successors, (1066), 451 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1066 transitions. [2023-11-12 00:13:28,823 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1066 transitions. Word has length 21 [2023-11-12 00:13:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:28,823 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 1066 transitions. [2023-11-12 00:13:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1066 transitions. [2023-11-12 00:13:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:13:28,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:28,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:28,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:13:28,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:28,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 258973241, now seen corresponding path program 2 times [2023-11-12 00:13:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744933168] [2023-11-12 00:13:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:30,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744933168] [2023-11-12 00:13:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744933168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-12 00:13:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632605473] [2023-11-12 00:13:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 00:13:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 00:13:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:13:30,105 INFO L87 Difference]: Start difference. First operand 452 states and 1066 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:31,024 INFO L93 Difference]: Finished difference Result 624 states and 1438 transitions. [2023-11-12 00:13:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:13:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-12 00:13:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:31,029 INFO L225 Difference]: With dead ends: 624 [2023-11-12 00:13:31,029 INFO L226 Difference]: Without dead ends: 624 [2023-11-12 00:13:31,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:13:31,031 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:31,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:13:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-11-12 00:13:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 485. [2023-11-12 00:13:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.393374741200828) internal successors, (1156), 484 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1156 transitions. [2023-11-12 00:13:31,050 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1156 transitions. Word has length 21 [2023-11-12 00:13:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:31,050 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 1156 transitions. [2023-11-12 00:13:31,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1156 transitions. [2023-11-12 00:13:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:13:31,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:31,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:31,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:13:31,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:31,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1244164765, now seen corresponding path program 3 times [2023-11-12 00:13:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149254447] [2023-11-12 00:13:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:13:32,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149254447] [2023-11-12 00:13:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149254447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:32,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:32,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-12 00:13:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089479328] [2023-11-12 00:13:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:32,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 00:13:32,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 00:13:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:13:32,210 INFO L87 Difference]: Start difference. First operand 485 states and 1156 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:33,248 INFO L93 Difference]: Finished difference Result 713 states and 1640 transitions. [2023-11-12 00:13:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:13:33,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-12 00:13:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:33,255 INFO L225 Difference]: With dead ends: 713 [2023-11-12 00:13:33,255 INFO L226 Difference]: Without dead ends: 713 [2023-11-12 00:13:33,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-11-12 00:13:33,256 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:33,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:13:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-11-12 00:13:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 438. [2023-11-12 00:13:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 436 states have (on average 2.360091743119266) internal successors, (1029), 437 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1029 transitions. [2023-11-12 00:13:33,276 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1029 transitions. Word has length 21 [2023-11-12 00:13:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:33,277 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1029 transitions. [2023-11-12 00:13:33,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:13:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1029 transitions. [2023-11-12 00:13:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:13:33,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:33,278 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:33,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:13:33,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:13:33,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1797204711, now seen corresponding path program 1 times [2023-11-12 00:13:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052380801] [2023-11-12 00:13:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:13:33,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:13:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:13:33,364 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:13:33,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:13:33,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-12 00:13:33,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-12 00:13:33,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-12 00:13:33,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-12 00:13:33,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-12 00:13:33,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-12 00:13:33,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:13:33,372 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:33,378 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 00:13:33,378 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:13:33,420 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre46 could not be translated [2023-11-12 00:13:33,421 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated [2023-11-12 00:13:33,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:13:33 BasicIcfg [2023-11-12 00:13:33,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:13:33,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:13:33,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:13:33,437 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:13:33,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:13:16" (3/4) ... [2023-11-12 00:13:33,439 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 00:13:33,473 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre46 could not be translated [2023-11-12 00:13:33,477 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated [2023-11-12 00:13:33,528 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:13:33,529 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:13:33,529 INFO L158 Benchmark]: Toolchain (without parser) took 18226.67ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 141.5MB in the beginning and 83.4MB in the end (delta: 58.1MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,530 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:13:33,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.13ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 111.4MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.65ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,531 INFO L158 Benchmark]: Boogie Preprocessor took 62.51ms. Allocated memory is still 184.5MB. Free memory was 108.7MB in the beginning and 107.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,532 INFO L158 Benchmark]: RCFGBuilder took 591.16ms. Allocated memory is still 184.5MB. Free memory was 107.2MB in the beginning and 89.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,532 INFO L158 Benchmark]: TraceAbstraction took 16609.72ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 89.1MB in the beginning and 91.8MB in the end (delta: -2.7MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,533 INFO L158 Benchmark]: Witness Printer took 92.11ms. Allocated memory is still 268.4MB. Free memory was 91.8MB in the beginning and 83.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 00:13:33,535 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.13ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 111.4MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.65ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.51ms. Allocated memory is still 184.5MB. Free memory was 108.7MB in the beginning and 107.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.16ms. Allocated memory is still 184.5MB. Free memory was 107.2MB in the beginning and 89.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16609.72ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 89.1MB in the beginning and 91.8MB in the end (delta: -2.7MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 92.11ms. Allocated memory is still 268.4MB. Free memory was 91.8MB in the beginning and 83.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 167 PlacesBefore, 38 PlacesAfterwards, 170 TransitionsBefore, 37 TransitionsAfterwards, 8340 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 26 ConcurrentYvCompositions, 4 ChoiceCompositions, 164 TotalNumberOfCompositions, 11571 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8647, independent: 8444, independent conditional: 0, independent unconditional: 8444, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6134, independent: 6055, independent conditional: 0, independent unconditional: 6055, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6134, independent: 6023, independent conditional: 0, independent unconditional: 6023, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 274, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8647, independent: 2389, independent conditional: 0, independent unconditional: 2389, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 6134, unknown conditional: 0, unknown unconditional: 6134] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 228, Positive conditional cache size: 0, Positive unconditional cache size: 228, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=0, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 270 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3502 IncrementalHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 0 mSDtfsCounter, 3502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=4, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1355 SizeOfPredicates, 1 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 00:13:33,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a9faf3-096d-47b5-872b-2504e7bdf7e3/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE