./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:55:52,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:55:52,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:55:52,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:55:52,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:55:52,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:55:52,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:55:52,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:55:52,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:55:52,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:55:52,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:55:52,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:55:52,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:55:52,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:55:52,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:55:52,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:55:52,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:55:52,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:55:52,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:55:52,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:55:52,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:55:52,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:55:52,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:55:52,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:55:52,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:55:52,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:55:52,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:55:52,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:55:52,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:55:52,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:55:52,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:55:52,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:55:52,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:55:52,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:55:52,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:55:52,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:55:52,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:55:52,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:55:52,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:55:52,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:55:52,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:55:52,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:55:52,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:55:52,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:55:52,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:55:52,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:55:52,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:55:52,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:55:52,323 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:55:52,324 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:55:52,324 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:55:52,324 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:55:52,325 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:55:52,326 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:55:52,326 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:55:52,326 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:55:52,326 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:55:52,327 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:55:52,327 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:55:52,327 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:55:52,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:55:52,329 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:55:52,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:55:52,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:55:52,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:55:52,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:55:52,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:55:52,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:55:52,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:55:52,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:55:52,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:55:52,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:55:52,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:55:52,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:55:52,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:55:52,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:55:52,333 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:55:52,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:55:52,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:55:52,334 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:55:52,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:55:52,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:55:52,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:55:52,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/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_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2022-11-23 13:55:52,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:55:52,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:55:52,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:55:52,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:55:52,699 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:55:52,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2022-11-23 13:55:55,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:55:56,040 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:55:56,041 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2022-11-23 13:55:56,067 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/data/d7c6e9763/9738a97ab2734270863eae3aefc8dbdd/FLAG1ab91de02 [2022-11-23 13:55:56,081 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/data/d7c6e9763/9738a97ab2734270863eae3aefc8dbdd [2022-11-23 13:55:56,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:55:56,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:55:56,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:55:56,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:55:56,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:55:56,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc5f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56, skipping insertion in model container [2022-11-23 13:55:56,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:55:56,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:55:56,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2022-11-23 13:55:56,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:55:56,627 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:55:56,640 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2022-11-23 13:55:56,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:55:56,794 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:55:56,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56 WrapperNode [2022-11-23 13:55:56,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:55:56,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:55:56,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:55:56,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:55:56,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,891 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-11-23 13:55:56,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:55:56,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:55:56,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:55:56,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:55:56,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,952 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:55:56,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:55:56,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:55:56,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:55:56,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (1/1) ... [2022-11-23 13:55:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:55:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:55:57,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:55:57,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:55:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:55:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:55:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:55:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:55:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:55:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:55:57,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:55:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:55:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:55:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 13:55:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 13:55:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 13:55:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 13:55:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:55:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:55:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:55:57,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:55:57,081 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:55:57,253 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:55:57,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:55:57,742 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:55:57,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:55:57,921 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:55:57,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:57 BoogieIcfgContainer [2022-11-23 13:55:57,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:55:57,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:55:57,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:55:57,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:55:57,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:55:56" (1/3) ... [2022-11-23 13:55:57,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de7b339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:55:57, skipping insertion in model container [2022-11-23 13:55:57,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:56" (2/3) ... [2022-11-23 13:55:57,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de7b339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:55:57, skipping insertion in model container [2022-11-23 13:55:57,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:57" (3/3) ... [2022-11-23 13:55:57,940 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-11-23 13:55:57,947 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 13:55:57,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:55:57,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 13:55:57,955 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:55:58,043 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:55:58,113 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:55:58,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 292 flow [2022-11-23 13:55:58,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 292 flow [2022-11-23 13:55:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-23 13:55:58,240 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-23 13:55:58,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:55:58,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-23 13:55:58,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 3276 [2022-11-23 13:56:03,970 INFO L134 LiptonReduction]: Checked pairs total: 9293 [2022-11-23 13:56:03,970 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-23 13:56:03,979 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2022-11-23 13:56:04,274 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4372 states, 4369 states have (on average 4.13321126115816) internal successors, (18058), 4371 states have internal predecessors, (18058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:04,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:56:04,302 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c4c8a0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:56:04,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 13:56:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 4372 states, 4369 states have (on average 4.13321126115816) internal successors, (18058), 4371 states have internal predecessors, (18058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 13:56:04,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:04,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 13:56:04,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 542294480, now seen corresponding path program 1 times [2022-11-23 13:56:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624925741] [2022-11-23 13:56:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:04,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:04,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624925741] [2022-11-23 13:56:04,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624925741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:04,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:56:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069869055] [2022-11-23 13:56:04,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:04,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:56:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:56:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:56:04,867 INFO L87 Difference]: Start difference. First operand has 4372 states, 4369 states have (on average 4.13321126115816) internal successors, (18058), 4371 states have internal predecessors, (18058), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:05,072 INFO L93 Difference]: Finished difference Result 3562 states and 13925 transitions. [2022-11-23 13:56:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:56:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 13:56:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:05,132 INFO L225 Difference]: With dead ends: 3562 [2022-11-23 13:56:05,132 INFO L226 Difference]: Without dead ends: 3437 [2022-11-23 13:56:05,133 INFO L412 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 [2022-11-23 13:56:05,139 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:05,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2022-11-23 13:56:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2022-11-23 13:56:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3436 states have (on average 3.928987194412107) internal successors, (13500), 3436 states have internal predecessors, (13500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2022-11-23 13:56:05,482 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 5 [2022-11-23 13:56:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:05,483 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2022-11-23 13:56:05,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2022-11-23 13:56:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:56:05,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:05,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:56:05,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1586505522, now seen corresponding path program 1 times [2022-11-23 13:56:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:05,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602623011] [2022-11-23 13:56:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:06,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:06,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602623011] [2022-11-23 13:56:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602623011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:06,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:06,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:56:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503826462] [2022-11-23 13:56:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:56:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:56:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:56:06,394 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:06,736 INFO L93 Difference]: Finished difference Result 3962 states and 15090 transitions. [2022-11-23 13:56:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:56:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:56:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:06,764 INFO L225 Difference]: With dead ends: 3962 [2022-11-23 13:56:06,765 INFO L226 Difference]: Without dead ends: 3337 [2022-11-23 13:56:06,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:06,767 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:06,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 24 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:56:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-11-23 13:56:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3337. [2022-11-23 13:56:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3336 states have (on average 3.908872901678657) internal successors, (13040), 3336 states have internal predecessors, (13040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 13040 transitions. [2022-11-23 13:56:06,928 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 13040 transitions. Word has length 12 [2022-11-23 13:56:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:06,929 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 13040 transitions. [2022-11-23 13:56:06,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 13040 transitions. [2022-11-23 13:56:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:56:06,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:06,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:56:06,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1149260690, now seen corresponding path program 1 times [2022-11-23 13:56:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81777802] [2022-11-23 13:56:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:08,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:08,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81777802] [2022-11-23 13:56:08,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81777802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:08,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:08,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:56:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152255479] [2022-11-23 13:56:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:56:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:56:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:08,042 INFO L87 Difference]: Start difference. First operand 3337 states and 13040 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:08,468 INFO L93 Difference]: Finished difference Result 3942 states and 15005 transitions. [2022-11-23 13:56:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:56:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:56:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:08,498 INFO L225 Difference]: With dead ends: 3942 [2022-11-23 13:56:08,498 INFO L226 Difference]: Without dead ends: 3344 [2022-11-23 13:56:08,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:56:08,502 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:08,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 30 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-11-23 13:56:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 3344. [2022-11-23 13:56:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 3343 states have (on average 3.8976966796290755) internal successors, (13030), 3343 states have internal predecessors, (13030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 13030 transitions. [2022-11-23 13:56:08,660 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 13030 transitions. Word has length 13 [2022-11-23 13:56:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:08,662 INFO L495 AbstractCegarLoop]: Abstraction has 3344 states and 13030 transitions. [2022-11-23 13:56:08,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 13030 transitions. [2022-11-23 13:56:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:56:08,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:08,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:08,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:56:08,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1799209935, now seen corresponding path program 1 times [2022-11-23 13:56:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886994248] [2022-11-23 13:56:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:09,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886994248] [2022-11-23 13:56:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886994248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:09,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:56:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260514478] [2022-11-23 13:56:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:09,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:56:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:56:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:56:09,725 INFO L87 Difference]: Start difference. First operand 3344 states and 13030 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:10,173 INFO L93 Difference]: Finished difference Result 3625 states and 13853 transitions. [2022-11-23 13:56:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:56:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-23 13:56:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:10,199 INFO L225 Difference]: With dead ends: 3625 [2022-11-23 13:56:10,200 INFO L226 Difference]: Without dead ends: 3254 [2022-11-23 13:56:10,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:56:10,201 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:10,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 42 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-11-23 13:56:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3185. [2022-11-23 13:56:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 3.879396984924623) internal successors, (12352), 3184 states have internal predecessors, (12352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 12352 transitions. [2022-11-23 13:56:10,354 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 12352 transitions. Word has length 15 [2022-11-23 13:56:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:10,356 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 12352 transitions. [2022-11-23 13:56:10,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 12352 transitions. [2022-11-23 13:56:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:56:10,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:10,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:10,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:56:10,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1131655745, now seen corresponding path program 1 times [2022-11-23 13:56:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:10,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658357337] [2022-11-23 13:56:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:11,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:11,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658357337] [2022-11-23 13:56:11,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658357337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:11,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:11,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:56:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484062902] [2022-11-23 13:56:11,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:11,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:56:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:56:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:56:11,125 INFO L87 Difference]: Start difference. First operand 3185 states and 12352 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:11,540 INFO L93 Difference]: Finished difference Result 4446 states and 16931 transitions. [2022-11-23 13:56:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:56:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-23 13:56:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:11,627 INFO L225 Difference]: With dead ends: 4446 [2022-11-23 13:56:11,628 INFO L226 Difference]: Without dead ends: 3870 [2022-11-23 13:56:11,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:56:11,629 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 83 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:11,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 46 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2022-11-23 13:56:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3739. [2022-11-23 13:56:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3738 states have (on average 3.8496522204387373) internal successors, (14390), 3738 states have internal predecessors, (14390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 14390 transitions. [2022-11-23 13:56:11,804 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 14390 transitions. Word has length 15 [2022-11-23 13:56:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:11,805 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 14390 transitions. [2022-11-23 13:56:11,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 14390 transitions. [2022-11-23 13:56:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:56:11,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:11,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:56:11,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1792460019, now seen corresponding path program 1 times [2022-11-23 13:56:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449738483] [2022-11-23 13:56:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:12,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:12,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449738483] [2022-11-23 13:56:12,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449738483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:12,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:12,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:56:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226616886] [2022-11-23 13:56:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:56:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:56:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:56:12,021 INFO L87 Difference]: Start difference. First operand 3739 states and 14390 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:12,124 INFO L93 Difference]: Finished difference Result 2803 states and 9710 transitions. [2022-11-23 13:56:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:56:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-23 13:56:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:12,139 INFO L225 Difference]: With dead ends: 2803 [2022-11-23 13:56:12,140 INFO L226 Difference]: Without dead ends: 2803 [2022-11-23 13:56:12,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:56:12,142 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:12,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2022-11-23 13:56:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2803. [2022-11-23 13:56:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2803 states, 2802 states have (on average 3.465381870092791) internal successors, (9710), 2802 states have internal predecessors, (9710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 9710 transitions. [2022-11-23 13:56:12,234 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 9710 transitions. Word has length 15 [2022-11-23 13:56:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:12,234 INFO L495 AbstractCegarLoop]: Abstraction has 2803 states and 9710 transitions. [2022-11-23 13:56:12,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 9710 transitions. [2022-11-23 13:56:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:56:12,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:12,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:12,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:56:12,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 440568532, now seen corresponding path program 1 times [2022-11-23 13:56:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:12,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817501047] [2022-11-23 13:56:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:12,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:12,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817501047] [2022-11-23 13:56:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817501047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:12,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:12,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:56:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784516261] [2022-11-23 13:56:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:12,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:56:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:56:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:56:12,456 INFO L87 Difference]: Start difference. First operand 2803 states and 9710 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) [2022-11-23 13:56:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:12,574 INFO L93 Difference]: Finished difference Result 1683 states and 5230 transitions. [2022-11-23 13:56:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:56:12,574 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 [2022-11-23 13:56:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:12,582 INFO L225 Difference]: With dead ends: 1683 [2022-11-23 13:56:12,582 INFO L226 Difference]: Without dead ends: 1683 [2022-11-23 13:56:12,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:56:12,584 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:12,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-11-23 13:56:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1519. [2022-11-23 13:56:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1518 states have (on average 3.072463768115942) internal successors, (4664), 1518 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 4664 transitions. [2022-11-23 13:56:12,633 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 4664 transitions. Word has length 16 [2022-11-23 13:56:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:12,634 INFO L495 AbstractCegarLoop]: Abstraction has 1519 states and 4664 transitions. [2022-11-23 13:56:12,634 INFO L496 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) [2022-11-23 13:56:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 4664 transitions. [2022-11-23 13:56:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 13:56:12,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:12,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:56:12,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1802407145, now seen corresponding path program 1 times [2022-11-23 13:56:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:12,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511067024] [2022-11-23 13:56:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:12,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511067024] [2022-11-23 13:56:12,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511067024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:12,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:12,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:56:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578874139] [2022-11-23 13:56:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:56:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:56:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:56:12,894 INFO L87 Difference]: Start difference. First operand 1519 states and 4664 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:13,031 INFO L93 Difference]: Finished difference Result 1111 states and 3440 transitions. [2022-11-23 13:56:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:56:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-23 13:56:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:13,036 INFO L225 Difference]: With dead ends: 1111 [2022-11-23 13:56:13,036 INFO L226 Difference]: Without dead ends: 1111 [2022-11-23 13:56:13,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:56:13,037 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:13,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 16 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-11-23 13:56:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1023. [2022-11-23 13:56:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.107632093933464) internal successors, (3176), 1022 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 3176 transitions. [2022-11-23 13:56:13,070 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 3176 transitions. Word has length 20 [2022-11-23 13:56:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:13,070 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 3176 transitions. [2022-11-23 13:56:13,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 3176 transitions. [2022-11-23 13:56:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 13:56:13,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:13,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:56:13,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -737308548, now seen corresponding path program 1 times [2022-11-23 13:56:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936917742] [2022-11-23 13:56:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:13,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:13,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936917742] [2022-11-23 13:56:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936917742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:13,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:56:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818660448] [2022-11-23 13:56:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:13,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:56:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:56:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:56:13,615 INFO L87 Difference]: Start difference. First operand 1023 states and 3176 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:14,000 INFO L93 Difference]: Finished difference Result 1552 states and 4742 transitions. [2022-11-23 13:56:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:56:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 13:56:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:14,005 INFO L225 Difference]: With dead ends: 1552 [2022-11-23 13:56:14,005 INFO L226 Difference]: Without dead ends: 1051 [2022-11-23 13:56:14,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:56:14,006 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 90 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:14,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 53 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-11-23 13:56:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 993. [2022-11-23 13:56:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 2.973790322580645) internal successors, (2950), 992 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2950 transitions. [2022-11-23 13:56:14,035 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2950 transitions. Word has length 24 [2022-11-23 13:56:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:14,037 INFO L495 AbstractCegarLoop]: Abstraction has 993 states and 2950 transitions. [2022-11-23 13:56:14,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2950 transitions. [2022-11-23 13:56:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 13:56:14,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:14,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:14,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:56:14,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash -788945668, now seen corresponding path program 2 times [2022-11-23 13:56:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:14,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575239980] [2022-11-23 13:56:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:14,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:14,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575239980] [2022-11-23 13:56:14,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575239980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:14,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:14,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:56:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047755677] [2022-11-23 13:56:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:14,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:56:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:14,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:56:14,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:14,318 INFO L87 Difference]: Start difference. First operand 993 states and 2950 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:14,457 INFO L93 Difference]: Finished difference Result 933 states and 2832 transitions. [2022-11-23 13:56:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:56:14,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-23 13:56:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:14,460 INFO L225 Difference]: With dead ends: 933 [2022-11-23 13:56:14,460 INFO L226 Difference]: Without dead ends: 661 [2022-11-23 13:56:14,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:14,461 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 110 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:14,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 15 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-23 13:56:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2022-11-23 13:56:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 3.0) internal successors, (1980), 660 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1980 transitions. [2022-11-23 13:56:14,479 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1980 transitions. Word has length 24 [2022-11-23 13:56:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:14,480 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1980 transitions. [2022-11-23 13:56:14,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1980 transitions. [2022-11-23 13:56:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:56:14,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:14,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:56:14,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash -992166377, now seen corresponding path program 1 times [2022-11-23 13:56:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:14,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945816027] [2022-11-23 13:56:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:15,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945816027] [2022-11-23 13:56:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945816027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:15,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:56:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469897480] [2022-11-23 13:56:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:56:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:56:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:56:15,263 INFO L87 Difference]: Start difference. First operand 661 states and 1980 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:15,827 INFO L93 Difference]: Finished difference Result 880 states and 2586 transitions. [2022-11-23 13:56:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:56:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:56:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:15,829 INFO L225 Difference]: With dead ends: 880 [2022-11-23 13:56:15,829 INFO L226 Difference]: Without dead ends: 347 [2022-11-23 13:56:15,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:56:15,830 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:15,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 34 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-23 13:56:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2022-11-23 13:56:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 2.7176470588235295) internal successors, (924), 340 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 924 transitions. [2022-11-23 13:56:15,842 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 924 transitions. Word has length 28 [2022-11-23 13:56:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:15,842 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 924 transitions. [2022-11-23 13:56:15,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 924 transitions. [2022-11-23 13:56:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:56:15,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:15,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:15,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 13:56:15,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash 252814753, now seen corresponding path program 2 times [2022-11-23 13:56:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203521615] [2022-11-23 13:56:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:17,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:17,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203521615] [2022-11-23 13:56:17,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203521615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:17,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:17,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:56:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653925940] [2022-11-23 13:56:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:56:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:56:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:56:17,051 INFO L87 Difference]: Start difference. First operand 341 states and 924 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:17,287 INFO L93 Difference]: Finished difference Result 482 states and 1298 transitions. [2022-11-23 13:56:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:56:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:56:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:17,290 INFO L225 Difference]: With dead ends: 482 [2022-11-23 13:56:17,290 INFO L226 Difference]: Without dead ends: 439 [2022-11-23 13:56:17,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:56:17,291 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:17,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 15 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:56:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-23 13:56:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 325. [2022-11-23 13:56:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.654320987654321) internal successors, (860), 324 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 860 transitions. [2022-11-23 13:56:17,301 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 860 transitions. Word has length 28 [2022-11-23 13:56:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:17,301 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 860 transitions. [2022-11-23 13:56:17,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 860 transitions. [2022-11-23 13:56:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:56:17,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:17,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:17,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 13:56:17,303 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1638119775, now seen corresponding path program 3 times [2022-11-23 13:56:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:17,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116079400] [2022-11-23 13:56:17,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:17,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:18,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116079400] [2022-11-23 13:56:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116079400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:18,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:18,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:56:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447751354] [2022-11-23 13:56:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:56:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:56:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:56:18,320 INFO L87 Difference]: Start difference. First operand 325 states and 860 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:18,708 INFO L93 Difference]: Finished difference Result 436 states and 1151 transitions. [2022-11-23 13:56:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:56:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:56:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:18,710 INFO L225 Difference]: With dead ends: 436 [2022-11-23 13:56:18,710 INFO L226 Difference]: Without dead ends: 373 [2022-11-23 13:56:18,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:56:18,711 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:18,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-23 13:56:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 301. [2022-11-23 13:56:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.6266666666666665) internal successors, (788), 300 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 788 transitions. [2022-11-23 13:56:18,720 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 788 transitions. Word has length 28 [2022-11-23 13:56:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:18,721 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 788 transitions. [2022-11-23 13:56:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 788 transitions. [2022-11-23 13:56:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:56:18,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:18,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:56:18,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -628590623, now seen corresponding path program 4 times [2022-11-23 13:56:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:18,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588088912] [2022-11-23 13:56:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:20,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:20,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588088912] [2022-11-23 13:56:20,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588088912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:20,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:20,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 13:56:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140143949] [2022-11-23 13:56:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:20,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:56:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:56:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:56:20,442 INFO L87 Difference]: Start difference. First operand 301 states and 788 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:20,874 INFO L93 Difference]: Finished difference Result 442 states and 1160 transitions. [2022-11-23 13:56:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:56:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:56:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:20,876 INFO L225 Difference]: With dead ends: 442 [2022-11-23 13:56:20,876 INFO L226 Difference]: Without dead ends: 285 [2022-11-23 13:56:20,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:56:20,877 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:20,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:56:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-23 13:56:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2022-11-23 13:56:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.579710144927536) internal successors, (712), 276 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 712 transitions. [2022-11-23 13:56:20,886 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 712 transitions. Word has length 28 [2022-11-23 13:56:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:20,886 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 712 transitions. [2022-11-23 13:56:20,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 712 transitions. [2022-11-23 13:56:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:56:20,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:20,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:20,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:56:20,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 13:56:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 879216929, now seen corresponding path program 5 times [2022-11-23 13:56:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:20,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879980674] [2022-11-23 13:56:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:56:20,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:56:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:56:21,029 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:56:21,030 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:56:21,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 13:56:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 13:56:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 13:56:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 13:56:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 13:56:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 13:56:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 13:56:21,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 13:56:21,037 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:21,043 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:56:21,043 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:56:21,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:56:21 BasicIcfg [2022-11-23 13:56:21,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:56:21,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:56:21,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:56:21,122 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:56:21,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:57" (3/4) ... [2022-11-23 13:56:21,124 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 13:56:21,208 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 13:56:21,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:56:21,209 INFO L158 Benchmark]: Toolchain (without parser) took 25123.71ms. Allocated memory was 132.1MB in the beginning and 656.4MB in the end (delta: 524.3MB). Free memory was 75.5MB in the beginning and 157.6MB in the end (delta: -82.1MB). Peak memory consumption was 443.5MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,209 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:56:21,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.43ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 75.2MB in the beginning and 137.0MB in the end (delta: -61.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.14ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 134.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,211 INFO L158 Benchmark]: Boogie Preprocessor took 72.36ms. Allocated memory is still 178.3MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,211 INFO L158 Benchmark]: RCFGBuilder took 959.94ms. Allocated memory is still 178.3MB. Free memory was 132.1MB in the beginning and 93.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,212 INFO L158 Benchmark]: TraceAbstraction took 23191.54ms. Allocated memory was 178.3MB in the beginning and 656.4MB in the end (delta: 478.2MB). Free memory was 93.0MB in the beginning and 174.3MB in the end (delta: -81.3MB). Peak memory consumption was 395.5MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,212 INFO L158 Benchmark]: Witness Printer took 87.14ms. Allocated memory is still 656.4MB. Free memory was 174.3MB in the beginning and 157.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 13:56:21,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.43ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 75.2MB in the beginning and 137.0MB in the end (delta: -61.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.14ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 134.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.36ms. Allocated memory is still 178.3MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 959.94ms. Allocated memory is still 178.3MB. Free memory was 132.1MB in the beginning and 93.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23191.54ms. Allocated memory was 178.3MB in the beginning and 656.4MB in the end (delta: 478.2MB). Free memory was 93.0MB in the beginning and 174.3MB in the end (delta: -81.3MB). Peak memory consumption was 395.5MB. Max. memory is 16.1GB. * Witness Printer took 87.14ms. Allocated memory is still 656.4MB. Free memory was 174.3MB in the beginning and 157.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 147 PlacesBefore, 47 PlacesAfterwards, 136 TransitionsBefore, 35 TransitionsAfterwards, 3276 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 9293 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4264, independent: 4044, independent conditional: 0, independent unconditional: 4044, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2264, independent: 2198, independent conditional: 0, independent unconditional: 2198, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2264, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 416, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4264, independent: 1846, independent conditional: 0, independent unconditional: 1846, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 2264, unknown conditional: 0, unknown unconditional: 2264] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-3, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-2, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L753] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2349 IncrementalHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 109 mSDtfsCounter, 2349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4372occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 710 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2022-11-23 13:56:21,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48530b18-c97e-4dd7-9fc9-3803dd75a614/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE