./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longest-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 03:09:14,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:09:14,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:09:14,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:09:14,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:09:14,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:09:14,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:09:14,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:09:14,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:09:14,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:09:14,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:09:14,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:09:14,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:09:14,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:09:14,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:09:14,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:09:14,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:09:14,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:09:14,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:09:14,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:09:14,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:09:14,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:09:14,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:09:14,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:09:14,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:09:14,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:09:14,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:09:14,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:09:14,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:09:14,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:09:14,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:09:14,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:09:14,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:09:14,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:09:14,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:09:14,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:09:14,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:09:14,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:09:14,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:09:14,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:09:14,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:09:14,468 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 03:09:14,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:09:14,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:09:14,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:09:14,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:09:14,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:09:14,511 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:09:14,511 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:09:14,512 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:09:14,512 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:09:14,512 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:09:14,512 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:09:14,512 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:09:14,512 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:09:14,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:09:14,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:09:14,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:09:14,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:09:14,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:09:14,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:09:14,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/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_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2022-12-14 03:09:14,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:09:14,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:09:14,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:09:14,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:09:14,735 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:09:14,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/stack_longest-1.i [2022-12-14 03:09:17,405 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:09:17,587 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:09:17,587 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/sv-benchmarks/c/pthread/stack_longest-1.i [2022-12-14 03:09:17,598 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/data/0d488bac6/7a0e8bd9c1014bcaa27ee5c3a2c5aa7c/FLAGce906aab8 [2022-12-14 03:09:17,608 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/data/0d488bac6/7a0e8bd9c1014bcaa27ee5c3a2c5aa7c [2022-12-14 03:09:17,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:09:17,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:09:17,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:09:17,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:09:17,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:09:17,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:09:17" (1/1) ... [2022-12-14 03:09:17,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d49fa11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:17, skipping insertion in model container [2022-12-14 03:09:17,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:09:17" (1/1) ... [2022-12-14 03:09:17,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:09:17,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:09:17,911 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2022-12-14 03:09:17,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:09:17,938 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:09:17,962 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2022-12-14 03:09:17,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:09:18,012 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:09:18,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18 WrapperNode [2022-12-14 03:09:18,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:09:18,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:09:18,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:09:18,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:09:18,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,053 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-14 03:09:18,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:09:18,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:09:18,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:09:18,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:09:18,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,072 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:09:18,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:09:18,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:09:18,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:09:18,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (1/1) ... [2022-12-14 03:09:18,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:09:18,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:18,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:09:18,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:09:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 03:09:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 03:09:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 03:09:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:09:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:09:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:09:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:09:18,133 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 03:09:18,249 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:09:18,251 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:09:18,470 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:09:18,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:09:18,479 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 03:09:18,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:09:18 BoogieIcfgContainer [2022-12-14 03:09:18,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:09:18,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:09:18,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:09:18,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:09:18,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:09:17" (1/3) ... [2022-12-14 03:09:18,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d0496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:09:18, skipping insertion in model container [2022-12-14 03:09:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:18" (2/3) ... [2022-12-14 03:09:18,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d0496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:09:18, skipping insertion in model container [2022-12-14 03:09:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:09:18" (3/3) ... [2022-12-14 03:09:18,491 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-12-14 03:09:18,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 03:09:18,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:09:18,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 03:09:18,510 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 03:09:18,588 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 03:09:18,622 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 03:09:18,637 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 179 transitions, 374 flow [2022-12-14 03:09:18,640 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 179 transitions, 374 flow [2022-12-14 03:09:18,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 179 transitions, 374 flow [2022-12-14 03:09:18,720 INFO L130 PetriNetUnfolder]: 10/177 cut-off events. [2022-12-14 03:09:18,720 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 03:09:18,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 177 events. 10/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 438 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2022-12-14 03:09:18,733 INFO L119 LiptonReduction]: Number of co-enabled transitions 9552 [2022-12-14 03:09:21,846 INFO L134 LiptonReduction]: Checked pairs total: 11791 [2022-12-14 03:09:21,846 INFO L136 LiptonReduction]: Total number of compositions: 168 [2022-12-14 03:09:21,852 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2022-12-14 03:09:21,875 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:21,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:09:21,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2dd91ed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:09:21,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 03:09:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 03:09:21,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:21,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 03:09:21,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 81703428, now seen corresponding path program 1 times [2022-12-14 03:09:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:21,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299663935] [2022-12-14 03:09:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299663935] [2022-12-14 03:09:22,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299663935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:22,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:22,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:09:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663191734] [2022-12-14 03:09:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:22,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:09:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:09:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,122 INFO L87 Difference]: Start difference. First operand has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 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) [2022-12-14 03:09:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:22,214 INFO L93 Difference]: Finished difference Result 502 states and 1336 transitions. [2022-12-14 03:09:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:09:22,216 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 [2022-12-14 03:09:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:22,230 INFO L225 Difference]: With dead ends: 502 [2022-12-14 03:09:22,231 INFO L226 Difference]: Without dead ends: 502 [2022-12-14 03:09:22,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,234 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2022-12-14 03:09:22,235 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] [2022-12-14 03:09:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-12-14 03:09:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 372. [2022-12-14 03:09:22,290 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) [2022-12-14 03:09:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1030 transitions. [2022-12-14 03:09:22,294 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1030 transitions. Word has length 6 [2022-12-14 03:09:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:22,295 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 1030 transitions. [2022-12-14 03:09:22,295 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) [2022-12-14 03:09:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1030 transitions. [2022-12-14 03:09:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:09:22,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:22,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:22,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:09:22,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 649569053, now seen corresponding path program 1 times [2022-12-14 03:09:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919594417] [2022-12-14 03:09:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:22,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919594417] [2022-12-14 03:09:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919594417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:22,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:22,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:09:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247707840] [2022-12-14 03:09:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:22,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:09:22,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:09:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,426 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) [2022-12-14 03:09:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:22,483 INFO L93 Difference]: Finished difference Result 450 states and 1202 transitions. [2022-12-14 03:09:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:09:22,483 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 [2022-12-14 03:09:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:22,486 INFO L225 Difference]: With dead ends: 450 [2022-12-14 03:09:22,486 INFO L226 Difference]: Without dead ends: 432 [2022-12-14 03:09:22,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,488 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:22,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:09:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-14 03:09:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 416. [2022-12-14 03:09:22,509 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) [2022-12-14 03:09:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1138 transitions. [2022-12-14 03:09:22,511 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1138 transitions. Word has length 8 [2022-12-14 03:09:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:22,512 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1138 transitions. [2022-12-14 03:09:22,512 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) [2022-12-14 03:09:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1138 transitions. [2022-12-14 03:09:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:09:22,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:22,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:22,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:09:22,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -583575364, now seen corresponding path program 1 times [2022-12-14 03:09:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564596034] [2022-12-14 03:09:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:22,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564596034] [2022-12-14 03:09:22,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564596034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:22,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:22,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:09:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091717987] [2022-12-14 03:09:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:22,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:09:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:09:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,588 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) [2022-12-14 03:09:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:22,643 INFO L93 Difference]: Finished difference Result 446 states and 1219 transitions. [2022-12-14 03:09:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:09:22,644 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 [2022-12-14 03:09:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:22,646 INFO L225 Difference]: With dead ends: 446 [2022-12-14 03:09:22,646 INFO L226 Difference]: Without dead ends: 446 [2022-12-14 03:09:22,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:22,647 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:22,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:09:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-12-14 03:09:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2022-12-14 03:09:22,657 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) [2022-12-14 03:09:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1219 transitions. [2022-12-14 03:09:22,659 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1219 transitions. Word has length 10 [2022-12-14 03:09:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:22,659 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1219 transitions. [2022-12-14 03:09:22,659 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) [2022-12-14 03:09:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1219 transitions. [2022-12-14 03:09:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 03:09:22,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:22,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:22,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 03:09:22,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1336821632, now seen corresponding path program 1 times [2022-12-14 03:09:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:22,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279725548] [2022-12-14 03:09:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:22,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279725548] [2022-12-14 03:09:22,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279725548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:09:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639967583] [2022-12-14 03:09:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:22,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:22,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:09:22,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:09:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:22,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 03:09:22,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:09:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:09:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:22,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639967583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:09:22,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943239248] [2022-12-14 03:09:22,896 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 03:09:22,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:09:22,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 03:09:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862759258] [2022-12-14 03:09:22,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:09:22,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:09:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:09:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:09:22,899 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) [2022-12-14 03:09:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:23,206 INFO L93 Difference]: Finished difference Result 1090 states and 2879 transitions. [2022-12-14 03:09:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:09:23,206 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 [2022-12-14 03:09:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:23,215 INFO L225 Difference]: With dead ends: 1090 [2022-12-14 03:09:23,215 INFO L226 Difference]: Without dead ends: 1090 [2022-12-14 03:09:23,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-12-14 03:09:23,217 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:23,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:09:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-12-14 03:09:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 798. [2022-12-14 03:09:23,242 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) [2022-12-14 03:09:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2196 transitions. [2022-12-14 03:09:23,247 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2196 transitions. Word has length 14 [2022-12-14 03:09:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:23,248 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2196 transitions. [2022-12-14 03:09:23,248 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) [2022-12-14 03:09:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2196 transitions. [2022-12-14 03:09:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 03:09:23,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:23,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:23,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:09:23,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:09:23,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash 26805223, now seen corresponding path program 1 times [2022-12-14 03:09:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:23,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75072990] [2022-12-14 03:09:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:23,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:23,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75072990] [2022-12-14 03:09:23,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75072990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:23,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:23,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:09:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020870145] [2022-12-14 03:09:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:23,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:09:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:09:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:23,509 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) [2022-12-14 03:09:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:23,558 INFO L93 Difference]: Finished difference Result 342 states and 792 transitions. [2022-12-14 03:09:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:09:23,558 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 [2022-12-14 03:09:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:23,561 INFO L225 Difference]: With dead ends: 342 [2022-12-14 03:09:23,561 INFO L226 Difference]: Without dead ends: 338 [2022-12-14 03:09:23,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:09:23,562 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:23,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:09:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-12-14 03:09:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 306. [2022-12-14 03:09:23,569 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) [2022-12-14 03:09:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 700 transitions. [2022-12-14 03:09:23,571 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 700 transitions. Word has length 16 [2022-12-14 03:09:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:23,571 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 700 transitions. [2022-12-14 03:09:23,572 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) [2022-12-14 03:09:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 700 transitions. [2022-12-14 03:09:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 03:09:23,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:23,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 03:09:23,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1509699469, now seen corresponding path program 1 times [2022-12-14 03:09:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:23,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517441402] [2022-12-14 03:09:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:23,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:23,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517441402] [2022-12-14 03:09:23,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517441402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:23,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:23,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:09:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540325132] [2022-12-14 03:09:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:23,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:09:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:09:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:09:23,657 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) [2022-12-14 03:09:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:23,758 INFO L93 Difference]: Finished difference Result 432 states and 982 transitions. [2022-12-14 03:09:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:09:23,759 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 [2022-12-14 03:09:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:23,760 INFO L225 Difference]: With dead ends: 432 [2022-12-14 03:09:23,761 INFO L226 Difference]: Without dead ends: 432 [2022-12-14 03:09:23,761 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 [2022-12-14 03:09:23,762 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 [2022-12-14 03:09:23,762 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] [2022-12-14 03:09:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-14 03:09:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 340. [2022-12-14 03:09:23,771 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) [2022-12-14 03:09:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 782 transitions. [2022-12-14 03:09:23,773 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 782 transitions. Word has length 17 [2022-12-14 03:09:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:23,773 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 782 transitions. [2022-12-14 03:09:23,773 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) [2022-12-14 03:09:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 782 transitions. [2022-12-14 03:09:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 03:09:23,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:23,774 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] [2022-12-14 03:09:23,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 03:09:23,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1675364324, now seen corresponding path program 1 times [2022-12-14 03:09:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990614281] [2022-12-14 03:09:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:24,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990614281] [2022-12-14 03:09:24,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990614281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:24,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:09:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584246353] [2022-12-14 03:09:24,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:24,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:09:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:09:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:09:24,321 INFO L87 Difference]: Start difference. First operand 340 states and 782 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-12-14 03:09:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:24,763 INFO L93 Difference]: Finished difference Result 554 states and 1262 transitions. [2022-12-14 03:09:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:09:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 [2022-12-14 03:09:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:24,766 INFO L225 Difference]: With dead ends: 554 [2022-12-14 03:09:24,766 INFO L226 Difference]: Without dead ends: 554 [2022-12-14 03:09:24,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:24,767 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:24,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 9 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:09:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-12-14 03:09:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 460. [2022-12-14 03:09:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 458 states have (on average 2.3799126637554586) internal successors, (1090), 459 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1090 transitions. [2022-12-14 03:09:24,782 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1090 transitions. Word has length 21 [2022-12-14 03:09:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:24,783 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 1090 transitions. [2022-12-14 03:09:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-12-14 03:09:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1090 transitions. [2022-12-14 03:09:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 03:09:24,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:24,784 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] [2022-12-14 03:09:24,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 03:09:24,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 895828732, now seen corresponding path program 2 times [2022-12-14 03:09:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:24,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297273932] [2022-12-14 03:09:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:09:25,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297273932] [2022-12-14 03:09:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297273932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:25,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:25,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:09:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429015528] [2022-12-14 03:09:25,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:09:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:09:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:09:25,340 INFO L87 Difference]: Start difference. First operand 460 states and 1090 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-12-14 03:09:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:25,735 INFO L93 Difference]: Finished difference Result 658 states and 1526 transitions. [2022-12-14 03:09:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:09:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 [2022-12-14 03:09:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:25,741 INFO L225 Difference]: With dead ends: 658 [2022-12-14 03:09:25,741 INFO L226 Difference]: Without dead ends: 658 [2022-12-14 03:09:25,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:09:25,742 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:25,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 8 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:09:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-12-14 03:09:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 446. [2022-12-14 03:09:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 2.3716216216216215) internal successors, (1053), 445 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1053 transitions. [2022-12-14 03:09:25,760 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1053 transitions. Word has length 21 [2022-12-14 03:09:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:25,760 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1053 transitions. [2022-12-14 03:09:25,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-12-14 03:09:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1053 transitions. [2022-12-14 03:09:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 03:09:25,762 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:25,762 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] [2022-12-14 03:09:25,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 03:09:25,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:09:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1034132030, now seen corresponding path program 1 times [2022-12-14 03:09:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:25,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916084157] [2022-12-14 03:09:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 03:09:25,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 03:09:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 03:09:25,871 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 03:09:25,871 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 03:09:25,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-14 03:09:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-14 03:09:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-14 03:09:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-14 03:09:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-14 03:09:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-14 03:09:25,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 03:09:25,877 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:25,881 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 03:09:25,881 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 03:09:25,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:09:25 BasicIcfg [2022-12-14 03:09:25,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 03:09:25,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 03:09:25,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 03:09:25,942 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 03:09:25,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:09:18" (3/4) ... [2022-12-14 03:09:25,944 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 03:09:26,008 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 03:09:26,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 03:09:26,009 INFO L158 Benchmark]: Toolchain (without parser) took 8397.50ms. Allocated memory was 113.2MB in the beginning and 220.2MB in the end (delta: 107.0MB). Free memory was 78.1MB in the beginning and 155.3MB in the end (delta: -77.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,009 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 81.1MB in the beginning and 80.9MB in the end (delta: 153.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.17ms. Allocated memory was 113.2MB in the beginning and 182.5MB in the end (delta: 69.2MB). Free memory was 78.1MB in the beginning and 153.6MB in the end (delta: -75.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 153.1MB in the end (delta: 395.7kB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,010 INFO L158 Benchmark]: Boogie Preprocessor took 21.88ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 151.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,011 INFO L158 Benchmark]: RCFGBuilder took 405.75ms. Allocated memory is still 182.5MB. Free memory was 151.9MB in the beginning and 134.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,011 INFO L158 Benchmark]: TraceAbstraction took 7457.06ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 133.0MB in the beginning and 164.7MB in the end (delta: -31.7MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,011 INFO L158 Benchmark]: Witness Printer took 66.54ms. Allocated memory is still 220.2MB. Free memory was 164.7MB in the beginning and 155.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 03:09:26,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 81.1MB in the beginning and 80.9MB in the end (delta: 153.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.17ms. Allocated memory was 113.2MB in the beginning and 182.5MB in the end (delta: 69.2MB). Free memory was 78.1MB in the beginning and 153.6MB in the end (delta: -75.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 153.1MB in the end (delta: 395.7kB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.88ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 151.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.75ms. Allocated memory is still 182.5MB. Free memory was 151.9MB in the beginning and 134.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7457.06ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 133.0MB in the beginning and 164.7MB in the end (delta: -31.7MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 66.54ms. Allocated memory is still 220.2MB. Free memory was 164.7MB in the beginning and 155.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 176 PlacesBefore, 38 PlacesAfterwards, 179 TransitionsBefore, 36 TransitionsAfterwards, 9552 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 103 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 5 ChoiceCompositions, 168 TotalNumberOfCompositions, 11791 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9420, independent: 9250, independent conditional: 0, independent unconditional: 9250, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7013, independent: 6932, independent conditional: 0, independent unconditional: 6932, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7013, independent: 6916, independent conditional: 0, independent unconditional: 6916, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9420, independent: 2318, independent conditional: 0, independent unconditional: 2318, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 7013, unknown conditional: 0, unknown unconditional: 7013] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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[(800)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={7:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=798, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={7:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=799, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=798, top=1] [L991] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=798, top=1] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 288 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1704 IncrementalHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 5 mSDtfsCounter, 1704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 868 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317 SizeOfPredicates, 1 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 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! [2022-12-14 03:09:26,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5479b8b4-25fe-4865-9b46-0bf814cf0411/bin/utaipan-gh47qXpMRh/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