./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:26:52,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:26:52,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-02 11:26:52,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:26:52,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:26:52,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:26:52,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:26:52,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:26:52,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:26:52,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:26:52,971 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:26:52,971 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:26:52,972 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:26:52,972 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:26:52,973 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:26:52,975 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:26:52,975 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:26:52,975 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:26:52,976 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:26:52,976 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:26:52,976 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:26:52,980 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:26:52,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:26:52,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 11:26:52,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:26:52,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:26:52,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:26:52,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:26:52,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 11:26:52,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:26:52,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 11:26:52,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:26:52,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:26:52,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 11:26:52,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:26:52,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:26:52,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:26:52,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:26:52,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:52,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:26:52,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:26:52,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 11:26:52,989 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:26:52,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:26:52,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:26:52,991 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:26:52,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:26:52,991 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/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_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2024-11-02 11:26:53,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:26:53,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:26:53,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:26:53,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:26:53,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:26:53,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i Unable to find full path for "g++" [2024-11-02 11:26:55,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:26:55,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:26:55,863 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2024-11-02 11:26:55,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/data/299268735/51d886f27bb2436790f3af3781b5dec9/FLAGbabddb4fd [2024-11-02 11:26:56,078 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/data/299268735/51d886f27bb2436790f3af3781b5dec9 [2024-11-02 11:26:56,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:26:56,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:26:56,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:56,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:26:56,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:26:56,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:56,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158c44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56, skipping insertion in model container [2024-11-02 11:26:56,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:56,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:26:56,435 WARN L251 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_a9c3092e-71ad-41e2-8fb1-3553ab19b703/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2024-11-02 11:26:56,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:56,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:26:56,766 WARN L251 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_a9c3092e-71ad-41e2-8fb1-3553ab19b703/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2024-11-02 11:26:56,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:56,858 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:26:56,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56 WrapperNode [2024-11-02 11:26:56,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:56,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:56,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:26:56,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:26:56,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:56,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:56,977 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-11-02 11:26:56,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:56,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:26:56,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:26:56,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:26:56,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:56,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:26:57,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:26:57,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:26:57,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:26:57,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (1/1) ... [2024-11-02 11:26:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:57,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:26:57,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:26:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-02 11:26:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:26:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-02 11:26:57,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-02 11:26:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-02 11:26:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-02 11:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-02 11:26:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-02 11:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-02 11:26:57,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-02 11:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-02 11:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:26:57,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:26:57,092 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 11:26:57,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:26:57,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:26:57,619 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 11:26:57,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:26:57,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:26:57,941 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 11:26:57,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:57 BoogieIcfgContainer [2024-11-02 11:26:57,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:26:57,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:26:57,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:26:57,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:26:57,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:26:56" (1/3) ... [2024-11-02 11:26:57,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa3fa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:57, skipping insertion in model container [2024-11-02 11:26:57,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:56" (2/3) ... [2024-11-02 11:26:57,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa3fa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:57, skipping insertion in model container [2024-11-02 11:26:57,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:57" (3/3) ... [2024-11-02 11:26:57,953 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2024-11-02 11:26:57,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:26:57,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-02 11:26:57,968 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 11:26:58,032 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-02 11:26:58,076 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 50 transitions, 116 flow [2024-11-02 11:27:00,259 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33728 states, 33725 states have (on average 4.36169014084507) internal successors, (147098), 33727 states have internal predecessors, (147098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:00,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:27:00,306 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75e68e6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:27:00,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-02 11:27:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 33728 states, 33725 states have (on average 4.36169014084507) internal successors, (147098), 33727 states have internal predecessors, (147098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 11:27:00,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:00,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:00,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -79975411, now seen corresponding path program 1 times [2024-11-02 11:27:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191313226] [2024-11-02 11:27:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:01,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191313226] [2024-11-02 11:27:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191313226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 11:27:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209672140] [2024-11-02 11:27:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:01,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:27:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:27:01,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:27:01,319 INFO L87 Difference]: Start difference. First operand has 33728 states, 33725 states have (on average 4.36169014084507) internal successors, (147098), 33727 states have internal predecessors, (147098), 0 states have call successors, (0), 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, 2 states have (on average 5.0) internal successors, (10), 2 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) [2024-11-02 11:27:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:02,537 INFO L93 Difference]: Finished difference Result 35100 states and 152684 transitions. [2024-11-02 11:27:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:27:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 [2024-11-02 11:27:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:03,172 INFO L225 Difference]: With dead ends: 35100 [2024-11-02 11:27:03,172 INFO L226 Difference]: Without dead ends: 28583 [2024-11-02 11:27:03,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:27:03,205 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:03,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28583 states. [2024-11-02 11:27:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28583 to 28583. [2024-11-02 11:27:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28583 states, 28582 states have (on average 4.323630256804982) internal successors, (123578), 28582 states have internal predecessors, (123578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28583 states to 28583 states and 123578 transitions. [2024-11-02 11:27:05,652 INFO L78 Accepts]: Start accepts. Automaton has 28583 states and 123578 transitions. Word has length 10 [2024-11-02 11:27:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:05,653 INFO L471 AbstractCegarLoop]: Abstraction has 28583 states and 123578 transitions. [2024-11-02 11:27:05,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2024-11-02 11:27:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 28583 states and 123578 transitions. [2024-11-02 11:27:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-02 11:27:05,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:05,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:05,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:27:05,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -324011465, now seen corresponding path program 1 times [2024-11-02 11:27:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313429125] [2024-11-02 11:27:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:06,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313429125] [2024-11-02 11:27:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313429125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:27:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340400099] [2024-11-02 11:27:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:27:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:27:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:27:06,055 INFO L87 Difference]: Start difference. First operand 28583 states and 123578 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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) [2024-11-02 11:27:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:07,240 INFO L93 Difference]: Finished difference Result 44067 states and 187124 transitions. [2024-11-02 11:27:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:27:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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 [2024-11-02 11:27:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:07,498 INFO L225 Difference]: With dead ends: 44067 [2024-11-02 11:27:07,499 INFO L226 Difference]: Without dead ends: 22458 [2024-11-02 11:27:07,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:27:07,837 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 82 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:07,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 58 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2024-11-02 11:27:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 22458. [2024-11-02 11:27:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22458 states, 22457 states have (on average 4.139154829229193) internal successors, (92953), 22457 states have internal predecessors, (92953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22458 states to 22458 states and 92953 transitions. [2024-11-02 11:27:09,175 INFO L78 Accepts]: Start accepts. Automaton has 22458 states and 92953 transitions. Word has length 16 [2024-11-02 11:27:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:09,176 INFO L471 AbstractCegarLoop]: Abstraction has 22458 states and 92953 transitions. [2024-11-02 11:27:09,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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) [2024-11-02 11:27:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22458 states and 92953 transitions. [2024-11-02 11:27:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:27:09,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:09,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:27:09,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:09,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 446628627, now seen corresponding path program 1 times [2024-11-02 11:27:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:09,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737807918] [2024-11-02 11:27:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:09,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737807918] [2024-11-02 11:27:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737807918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:09,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:09,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:27:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015302002] [2024-11-02 11:27:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:09,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:27:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:27:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:27:09,481 INFO L87 Difference]: Start difference. First operand 22458 states and 92953 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2024-11-02 11:27:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:10,018 INFO L93 Difference]: Finished difference Result 28842 states and 116849 transitions. [2024-11-02 11:27:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:27:10,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 [2024-11-02 11:27:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:10,162 INFO L225 Difference]: With dead ends: 28842 [2024-11-02 11:27:10,163 INFO L226 Difference]: Without dead ends: 13358 [2024-11-02 11:27:10,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:27:10,200 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 152 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:10,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2024-11-02 11:27:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 13358. [2024-11-02 11:27:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13358 states, 13357 states have (on average 3.8933143669985775) internal successors, (52003), 13357 states have internal predecessors, (52003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13358 states to 13358 states and 52003 transitions. [2024-11-02 11:27:11,207 INFO L78 Accepts]: Start accepts. Automaton has 13358 states and 52003 transitions. Word has length 21 [2024-11-02 11:27:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:11,207 INFO L471 AbstractCegarLoop]: Abstraction has 13358 states and 52003 transitions. [2024-11-02 11:27:11,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2024-11-02 11:27:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 13358 states and 52003 transitions. [2024-11-02 11:27:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 11:27:11,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:11,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:27:11,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1332539457, now seen corresponding path program 1 times [2024-11-02 11:27:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:11,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381764772] [2024-11-02 11:27:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:11,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381764772] [2024-11-02 11:27:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381764772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:27:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437923543] [2024-11-02 11:27:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:11,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:27:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:27:11,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:27:11,556 INFO L87 Difference]: Start difference. First operand 13358 states and 52003 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:11,890 INFO L93 Difference]: Finished difference Result 14702 states and 56459 transitions. [2024-11-02 11:27:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:27:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-02 11:27:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:11,971 INFO L225 Difference]: With dead ends: 14702 [2024-11-02 11:27:11,972 INFO L226 Difference]: Without dead ends: 8318 [2024-11-02 11:27:11,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:27:11,986 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 200 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:11,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 91 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2024-11-02 11:27:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 8318. [2024-11-02 11:27:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8318 states, 8317 states have (on average 3.828664181796321) internal successors, (31843), 8317 states have internal predecessors, (31843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8318 states to 8318 states and 31843 transitions. [2024-11-02 11:27:12,265 INFO L78 Accepts]: Start accepts. Automaton has 8318 states and 31843 transitions. Word has length 26 [2024-11-02 11:27:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:12,266 INFO L471 AbstractCegarLoop]: Abstraction has 8318 states and 31843 transitions. [2024-11-02 11:27:12,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8318 states and 31843 transitions. [2024-11-02 11:27:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-02 11:27:12,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:12,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:27:12,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:12,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1634851341, now seen corresponding path program 1 times [2024-11-02 11:27:12,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:12,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16407841] [2024-11-02 11:27:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:12,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:12,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:12,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16407841] [2024-11-02 11:27:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16407841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:12,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839966070] [2024-11-02 11:27:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 11:27:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 11:27:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:27:12,980 INFO L87 Difference]: Start difference. First operand 8318 states and 31843 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:13,299 INFO L93 Difference]: Finished difference Result 8430 states and 32163 transitions. [2024-11-02 11:27:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:27:13,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-02 11:27:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:13,367 INFO L225 Difference]: With dead ends: 8430 [2024-11-02 11:27:13,367 INFO L226 Difference]: Without dead ends: 7086 [2024-11-02 11:27:13,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:27:13,375 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 230 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:13,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 75 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2024-11-02 11:27:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 7086. [2024-11-02 11:27:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 3.8858151023288636) internal successors, (27531), 7085 states have internal predecessors, (27531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 27531 transitions. [2024-11-02 11:27:13,621 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 27531 transitions. Word has length 31 [2024-11-02 11:27:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:13,622 INFO L471 AbstractCegarLoop]: Abstraction has 7086 states and 27531 transitions. [2024-11-02 11:27:13,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 27531 transitions. [2024-11-02 11:27:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:13,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:13,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:27:13,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1488511216, now seen corresponding path program 1 times [2024-11-02 11:27:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390815991] [2024-11-02 11:27:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:14,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:14,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390815991] [2024-11-02 11:27:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390815991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:14,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114799854] [2024-11-02 11:27:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:14,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:27:14,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:27:14,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:27:14,114 INFO L87 Difference]: Start difference. First operand 7086 states and 27531 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:14,540 INFO L93 Difference]: Finished difference Result 11870 states and 45799 transitions. [2024-11-02 11:27:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:27:14,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-02 11:27:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:14,599 INFO L225 Difference]: With dead ends: 11870 [2024-11-02 11:27:14,599 INFO L226 Difference]: Without dead ends: 5054 [2024-11-02 11:27:14,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:27:14,728 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:14,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 155 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2024-11-02 11:27:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 3678. [2024-11-02 11:27:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3677 states have (on average 3.6766385640467774) internal successors, (13519), 3677 states have internal predecessors, (13519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 13519 transitions. [2024-11-02 11:27:14,879 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 13519 transitions. Word has length 38 [2024-11-02 11:27:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:14,879 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 13519 transitions. [2024-11-02 11:27:14,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 13519 transitions. [2024-11-02 11:27:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:14,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:14,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:14,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 11:27:14,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:14,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 608869444, now seen corresponding path program 2 times [2024-11-02 11:27:14,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:14,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094282061] [2024-11-02 11:27:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:15,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094282061] [2024-11-02 11:27:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094282061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102466202] [2024-11-02 11:27:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:27:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:27:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:27:15,395 INFO L87 Difference]: Start difference. First operand 3678 states and 13519 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:15,638 INFO L93 Difference]: Finished difference Result 5750 states and 20541 transitions. [2024-11-02 11:27:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:27:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-02 11:27:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:15,685 INFO L225 Difference]: With dead ends: 5750 [2024-11-02 11:27:15,685 INFO L226 Difference]: Without dead ends: 3906 [2024-11-02 11:27:15,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:27:15,694 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 138 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2024-11-02 11:27:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3258. [2024-11-02 11:27:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 3257 states have (on average 3.608228431071538) internal successors, (11752), 3257 states have internal predecessors, (11752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 11752 transitions. [2024-11-02 11:27:15,830 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 11752 transitions. Word has length 38 [2024-11-02 11:27:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:15,831 INFO L471 AbstractCegarLoop]: Abstraction has 3258 states and 11752 transitions. [2024-11-02 11:27:15,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 11752 transitions. [2024-11-02 11:27:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:15,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:15,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:15,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 11:27:15,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:15,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1422208978, now seen corresponding path program 3 times [2024-11-02 11:27:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:15,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439921144] [2024-11-02 11:27:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:16,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439921144] [2024-11-02 11:27:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439921144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:16,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:16,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218387173] [2024-11-02 11:27:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:16,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:27:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:27:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:27:16,248 INFO L87 Difference]: Start difference. First operand 3258 states and 11752 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:16,516 INFO L93 Difference]: Finished difference Result 4602 states and 16524 transitions. [2024-11-02 11:27:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:27:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-02 11:27:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:16,560 INFO L225 Difference]: With dead ends: 4602 [2024-11-02 11:27:16,560 INFO L226 Difference]: Without dead ends: 2098 [2024-11-02 11:27:16,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:27:16,569 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 55 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:16,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2024-11-02 11:27:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2024-11-02 11:27:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 3.5107296137339055) internal successors, (7362), 2097 states have internal predecessors, (7362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7362 transitions. [2024-11-02 11:27:16,692 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7362 transitions. Word has length 38 [2024-11-02 11:27:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:16,693 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 7362 transitions. [2024-11-02 11:27:16,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7362 transitions. [2024-11-02 11:27:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:16,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:16,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 11:27:16,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:16,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1247159920, now seen corresponding path program 4 times [2024-11-02 11:27:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600284848] [2024-11-02 11:27:16,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:17,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600284848] [2024-11-02 11:27:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600284848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:17,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:27:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781008752] [2024-11-02 11:27:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:17,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:27:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:27:17,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:27:17,131 INFO L87 Difference]: Start difference. First operand 2098 states and 7362 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:17,315 INFO L93 Difference]: Finished difference Result 3170 states and 11154 transitions. [2024-11-02 11:27:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:27:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-02 11:27:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:17,359 INFO L225 Difference]: With dead ends: 3170 [2024-11-02 11:27:17,360 INFO L226 Difference]: Without dead ends: 1406 [2024-11-02 11:27:17,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:27:17,365 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:17,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-02 11:27:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2024-11-02 11:27:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 3.4562277580071172) internal successors, (4856), 1405 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 4856 transitions. [2024-11-02 11:27:17,451 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 4856 transitions. Word has length 38 [2024-11-02 11:27:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:17,452 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 4856 transitions. [2024-11-02 11:27:17,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 4856 transitions. [2024-11-02 11:27:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:17,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:17,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 11:27:17,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 709708564, now seen corresponding path program 5 times [2024-11-02 11:27:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836014767] [2024-11-02 11:27:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:18,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836014767] [2024-11-02 11:27:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836014767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 11:27:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121479811] [2024-11-02 11:27:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 11:27:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 11:27:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:27:18,453 INFO L87 Difference]: Start difference. First operand 1406 states and 4856 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:18,815 INFO L93 Difference]: Finished difference Result 1902 states and 6504 transitions. [2024-11-02 11:27:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 11:27:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-02 11:27:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:18,856 INFO L225 Difference]: With dead ends: 1902 [2024-11-02 11:27:18,856 INFO L226 Difference]: Without dead ends: 902 [2024-11-02 11:27:18,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:27:18,860 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:18,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 199 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-02 11:27:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-11-02 11:27:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.2319644839067703) internal successors, (2912), 901 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2912 transitions. [2024-11-02 11:27:18,932 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2912 transitions. Word has length 38 [2024-11-02 11:27:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:18,933 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 2912 transitions. [2024-11-02 11:27:18,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:27:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2912 transitions. [2024-11-02 11:27:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-02 11:27:18,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:18,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:18,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 11:27:18,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-02 11:27:18,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1370524656, now seen corresponding path program 6 times [2024-11-02 11:27:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:18,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299913727] [2024-11-02 11:27:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:27:19,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 11:27:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:27:19,135 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 11:27:19,135 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 11:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-02 11:27:19,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-02 11:27:19,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-02 11:27:19,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-02 11:27:19,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-02 11:27:19,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-02 11:27:19,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-02 11:27:19,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 11:27:19,145 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-02 11:27:19,298 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-02 11:27:19,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 11:27:19,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:27:19 BasicIcfg [2024-11-02 11:27:19,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 11:27:19,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 11:27:19,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 11:27:19,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 11:27:19,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:57" (3/4) ... [2024-11-02 11:27:19,307 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 11:27:19,425 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 11:27:19,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 11:27:19,429 INFO L158 Benchmark]: Toolchain (without parser) took 23344.49ms. Allocated memory was 161.5MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 131.2MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 746.3MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,429 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:27:19,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.91ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 105.1MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.87ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 127.6MB in the end (delta: -22.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,430 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 126.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,430 INFO L158 Benchmark]: RCFGBuilder took 921.93ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 78.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,430 INFO L158 Benchmark]: TraceAbstraction took 21358.66ms. Allocated memory was 161.5MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 77.3MB in the beginning and 10.4GB in the end (delta: -10.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-02 11:27:19,431 INFO L158 Benchmark]: Witness Printer took 123.41ms. Allocated memory is still 11.2GB. Free memory was 10.4GB in the beginning and 10.4GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-02 11:27:19,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.91ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 105.1MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.87ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 127.6MB in the end (delta: -22.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 126.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 921.93ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 78.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21358.66ms. Allocated memory was 161.5MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 77.3MB in the beginning and 10.4GB in the end (delta: -10.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 123.41ms. Allocated memory is still 11.2GB. Free memory was 10.4GB in the beginning and 10.4GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-3, t1062=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-3, t1062=-2, t1063=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061=-3, t1062=-2, t1063=-1, t1064=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-3, t1062=-2, t1063=-1, t1064=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-3, t1062=-2, t1063=-1, t1064=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061=-3, t1062=-2, t1063=-1, t1064=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.3s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1133 IncrementalHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 286 mSDtfsCounter, 1133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33728occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2024 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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! [2024-11-02 11:27:19,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9c3092e-71ad-41e2-8fb1-3553ab19b703/bin/utaipan-verify-DbMuA5NWw2/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