./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8 --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 131b586559fae88fae42a8ce395409ddab4527dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:13:03,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:13:03,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:13:03,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:13:03,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:13:03,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:13:03,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:13:03,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:13:03,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:13:03,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:13:03,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:13:03,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:13:03,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:13:03,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:13:03,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:13:03,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:13:03,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:13:03,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:13:03,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:13:03,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:13:03,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:13:03,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:13:03,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:13:03,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:13:03,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:13:03,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:13:03,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:13:03,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:13:03,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:13:03,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:13:03,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:13:03,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:13:03,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:13:03,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:13:03,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:13:03,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:13:03,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:13:03,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:13:03,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:13:03,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:13:03,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:13:03,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:13:03,222 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:13:03,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:13:03,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:13:03,224 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:13:03,224 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:13:03,224 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:13:03,224 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:13:03,225 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:13:03,225 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:13:03,225 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:13:03,225 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:13:03,226 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:13:03,226 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:13:03,226 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:13:03,226 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:13:03,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:13:03,227 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:13:03,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:13:03,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:13:03,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:13:03,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:13:03,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:13:03,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:13:03,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:13:03,240 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:13:03,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:13:03,241 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:13:03,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:13:03,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:13:03,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:13:03,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:13:03,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:13:03,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:13:03,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:13:03,243 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:13:03,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:13:03,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:13:03,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:13:03,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:13:03,244 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/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_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8 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 -> 131b586559fae88fae42a8ce395409ddab4527dc [2021-10-13 07:13:03,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:13:03,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:13:03,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:13:03,533 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:13:03,534 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:13:03,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i [2021-10-13 07:13:03,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/data/4d2b9f52c/75c64ecf1fc94947a4855abde4ac3076/FLAG60b66df34 [2021-10-13 07:13:04,222 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:13:04,223 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i [2021-10-13 07:13:04,241 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/data/4d2b9f52c/75c64ecf1fc94947a4855abde4ac3076/FLAG60b66df34 [2021-10-13 07:13:04,488 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/data/4d2b9f52c/75c64ecf1fc94947a4855abde4ac3076 [2021-10-13 07:13:04,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:13:04,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:13:04,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:13:04,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:13:04,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:13:04,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:04" (1/1) ... [2021-10-13 07:13:04,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c22dd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:04, skipping insertion in model container [2021-10-13 07:13:04,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:04" (1/1) ... [2021-10-13 07:13:04,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:13:04,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:13:04,845 WARN L228 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_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i[948,961] [2021-10-13 07:13:05,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:13:05,199 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:13:05,217 WARN L228 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_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i[948,961] [2021-10-13 07:13:05,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:13:05,370 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:13:05,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05 WrapperNode [2021-10-13 07:13:05,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:13:05,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:13:05,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:13:05,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:13:05,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:13:05,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:13:05,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:13:05,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:13:05,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:13:05,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:13:05,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:13:05,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:13:05,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (1/1) ... [2021-10-13 07:13:05,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:13:05,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:13:05,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:13:05,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:13:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 07:13:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 07:13:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:13:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:13:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 07:13:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 07:13:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 07:13:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 07:13:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:13:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 07:13:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:13:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:13:05,658 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 07:13:07,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:13:07,687 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 07:13:07,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:07 BoogieIcfgContainer [2021-10-13 07:13:07,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:13:07,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:13:07,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:13:07,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:13:07,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:13:04" (1/3) ... [2021-10-13 07:13:07,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d002651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:07, skipping insertion in model container [2021-10-13 07:13:07,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:05" (2/3) ... [2021-10-13 07:13:07,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d002651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:07, skipping insertion in model container [2021-10-13 07:13:07,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:07" (3/3) ... [2021-10-13 07:13:07,699 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2021-10-13 07:13:07,705 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 07:13:07,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:13:07,706 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 07:13:07,706 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 07:13:07,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,758 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,759 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,759 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:13:07,769 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 07:13:07,814 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:13:07,821 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:13:07,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 07:13:07,838 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 07:13:07,850 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 190 flow [2021-10-13 07:13:07,853 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 190 flow [2021-10-13 07:13:07,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2021-10-13 07:13:07,900 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2021-10-13 07:13:07,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 07:13:07,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2021-10-13 07:13:07,907 INFO L116 LiptonReduction]: Number of co-enabled transitions 1122 [2021-10-13 07:13:18,216 INFO L131 LiptonReduction]: Checked pairs total: 2912 [2021-10-13 07:13:18,217 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-10-13 07:13:18,225 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2021-10-13 07:13:18,251 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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) [2021-10-13 07:13:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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) [2021-10-13 07:13:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 07:13:18,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:18,261 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 07:13:18,262 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 909888333, now seen corresponding path program 1 times [2021-10-13 07:13:18,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:18,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973749558] [2021-10-13 07:13:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:18,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:18,529 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:18,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973749558] [2021-10-13 07:13:18,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973749558] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:18,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:18,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:13:18,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717258397] [2021-10-13 07:13:18,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:13:18,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:13:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:13:18,556 INFO L87 Difference]: Start difference. First operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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) [2021-10-13 07:13:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:18,641 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2021-10-13 07:13:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:13:18,643 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 [2021-10-13 07:13:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:18,664 INFO L225 Difference]: With dead ends: 167 [2021-10-13 07:13:18,665 INFO L226 Difference]: Without dead ends: 162 [2021-10-13 07:13:18,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:13:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-13 07:13:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-10-13 07:13:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.391304347826087) internal successors, (385), 161 states have internal predecessors, (385), 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) [2021-10-13 07:13:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2021-10-13 07:13:18,745 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2021-10-13 07:13:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:18,745 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2021-10-13 07:13:18,746 INFO L471 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) [2021-10-13 07:13:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2021-10-13 07:13:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:13:18,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:18,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:18,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:13:18,748 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 947056071, now seen corresponding path program 1 times [2021-10-13 07:13:18,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:18,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176527987] [2021-10-13 07:13:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:18,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:18,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:18,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176527987] [2021-10-13 07:13:18,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176527987] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:18,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:18,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:13:18,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449949884] [2021-10-13 07:13:18,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:13:18,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:13:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:13:18,994 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:19,037 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2021-10-13 07:13:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:13:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 07:13:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:19,045 INFO L225 Difference]: With dead ends: 172 [2021-10-13 07:13:19,045 INFO L226 Difference]: Without dead ends: 142 [2021-10-13 07:13:19,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:13:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-13 07:13:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-10-13 07:13:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.3333333333333335) internal successors, (329), 141 states have internal predecessors, (329), 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) [2021-10-13 07:13:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2021-10-13 07:13:19,061 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2021-10-13 07:13:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:19,062 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2021-10-13 07:13:19,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2021-10-13 07:13:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:13:19,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:19,065 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:19,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:13:19,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash -464014640, now seen corresponding path program 1 times [2021-10-13 07:13:19,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:19,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256221195] [2021-10-13 07:13:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:19,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:19,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:19,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256221195] [2021-10-13 07:13:19,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256221195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:19,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:19,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:13:19,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383362885] [2021-10-13 07:13:19,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:13:19,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:13:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:13:19,456 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:19,605 INFO L93 Difference]: Finished difference Result 154 states and 340 transitions. [2021-10-13 07:13:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:13:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:13:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:19,608 INFO L225 Difference]: With dead ends: 154 [2021-10-13 07:13:19,608 INFO L226 Difference]: Without dead ends: 134 [2021-10-13 07:13:19,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:13:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-10-13 07:13:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-10-13 07:13:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.293233082706767) internal successors, (305), 133 states have internal predecessors, (305), 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) [2021-10-13 07:13:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 305 transitions. [2021-10-13 07:13:19,619 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 305 transitions. Word has length 10 [2021-10-13 07:13:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:19,619 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 305 transitions. [2021-10-13 07:13:19,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 305 transitions. [2021-10-13 07:13:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:13:19,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:19,622 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:19,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:13:19,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:19,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:19,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1333127093, now seen corresponding path program 1 times [2021-10-13 07:13:19,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:19,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942699398] [2021-10-13 07:13:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:19,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:19,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:19,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942699398] [2021-10-13 07:13:19,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942699398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:19,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:19,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:13:19,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432504013] [2021-10-13 07:13:19,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:13:19,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:13:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:13:19,923 INFO L87 Difference]: Start difference. First operand 134 states and 305 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2021-10-13 07:13:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:20,128 INFO L93 Difference]: Finished difference Result 176 states and 387 transitions. [2021-10-13 07:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:13:20,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 [2021-10-13 07:13:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:20,132 INFO L225 Difference]: With dead ends: 176 [2021-10-13 07:13:20,132 INFO L226 Difference]: Without dead ends: 158 [2021-10-13 07:13:20,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:13:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-13 07:13:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2021-10-13 07:13:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.2549019607843137) internal successors, (345), 153 states have internal predecessors, (345), 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) [2021-10-13 07:13:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 345 transitions. [2021-10-13 07:13:20,143 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 345 transitions. Word has length 12 [2021-10-13 07:13:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:20,144 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 345 transitions. [2021-10-13 07:13:20,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2021-10-13 07:13:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 345 transitions. [2021-10-13 07:13:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:13:20,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:20,146 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:20,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:13:20,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash 689835919, now seen corresponding path program 1 times [2021-10-13 07:13:20,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:20,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116292918] [2021-10-13 07:13:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:20,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:20,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:20,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116292918] [2021-10-13 07:13:20,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116292918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:20,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:20,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:13:20,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346624812] [2021-10-13 07:13:20,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:13:20,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:13:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:13:20,340 INFO L87 Difference]: Start difference. First operand 154 states and 345 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:20,365 INFO L93 Difference]: Finished difference Result 132 states and 250 transitions. [2021-10-13 07:13:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:13:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 07:13:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:20,367 INFO L225 Difference]: With dead ends: 132 [2021-10-13 07:13:20,367 INFO L226 Difference]: Without dead ends: 94 [2021-10-13 07:13:20,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:13:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-10-13 07:13:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-10-13 07:13:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7741935483870968) internal successors, (165), 93 states have internal predecessors, (165), 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) [2021-10-13 07:13:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 165 transitions. [2021-10-13 07:13:20,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 165 transitions. Word has length 12 [2021-10-13 07:13:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:20,400 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 165 transitions. [2021-10-13 07:13:20,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2021-10-13 07:13:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:13:20,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:20,401 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:20,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:13:20,402 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1143744737, now seen corresponding path program 1 times [2021-10-13 07:13:20,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:20,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638457612] [2021-10-13 07:13:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:20,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:20,538 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:20,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638457612] [2021-10-13 07:13:20,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638457612] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:20,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:20,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:13:20,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975217693] [2021-10-13 07:13:20,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:13:20,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:13:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:13:20,541 INFO L87 Difference]: Start difference. First operand 94 states and 165 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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) [2021-10-13 07:13:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:20,574 INFO L93 Difference]: Finished difference Result 68 states and 111 transitions. [2021-10-13 07:13:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:13:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 [2021-10-13 07:13:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:20,576 INFO L225 Difference]: With dead ends: 68 [2021-10-13 07:13:20,576 INFO L226 Difference]: Without dead ends: 54 [2021-10-13 07:13:20,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:13:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-13 07:13:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2021-10-13 07:13:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 45 states have internal predecessors, (73), 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) [2021-10-13 07:13:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2021-10-13 07:13:20,582 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2021-10-13 07:13:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:20,582 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2021-10-13 07:13:20,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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) [2021-10-13 07:13:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2021-10-13 07:13:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:13:20,586 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:20,587 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:20,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:13:20,589 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1398646952, now seen corresponding path program 1 times [2021-10-13 07:13:20,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:20,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519980934] [2021-10-13 07:13:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:20,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:20,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:20,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519980934] [2021-10-13 07:13:20,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519980934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:20,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:20,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:13:20,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662667451] [2021-10-13 07:13:20,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:13:20,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:13:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:13:20,761 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:20,799 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2021-10-13 07:13:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:13:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:13:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:20,800 INFO L225 Difference]: With dead ends: 61 [2021-10-13 07:13:20,800 INFO L226 Difference]: Without dead ends: 26 [2021-10-13 07:13:20,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:13:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-13 07:13:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-13 07:13:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2021-10-13 07:13:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-13 07:13:20,805 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2021-10-13 07:13:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:20,805 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-13 07:13:20,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-13 07:13:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:13:20,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:20,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:20,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:13:20,807 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash 209079364, now seen corresponding path program 2 times [2021-10-13 07:13:20,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:20,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296178488] [2021-10-13 07:13:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:20,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:13:21,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:13:21,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296178488] [2021-10-13 07:13:21,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296178488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:13:21,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:13:21,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:13:21,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18371305] [2021-10-13 07:13:21,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:13:21,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:13:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:13:21,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:13:21,293 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:21,474 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-10-13 07:13:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:13:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:13:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:21,475 INFO L225 Difference]: With dead ends: 35 [2021-10-13 07:13:21,475 INFO L226 Difference]: Without dead ends: 22 [2021-10-13 07:13:21,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 183.9ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:13:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-10-13 07:13:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-13 07:13:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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) [2021-10-13 07:13:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-10-13 07:13:21,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2021-10-13 07:13:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:21,478 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-10-13 07:13:21,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:13:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-10-13 07:13:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:13:21,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:13:21,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:13:21,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:13:21,479 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-13 07:13:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:13:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1700557120, now seen corresponding path program 3 times [2021-10-13 07:13:21,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:13:21,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809118945] [2021-10-13 07:13:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:13:21,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:13:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:13:21,576 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:13:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:13:21,664 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:13:21,664 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:13:21,665 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:21,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:21,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 07:13:21,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 07:13:21,668 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:21,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:13:21,675 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 07:13:21,676 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:13:21,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:13:21 BasicIcfg [2021-10-13 07:13:21,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:13:21,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:13:21,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:13:21,743 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:13:21,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:07" (3/4) ... [2021-10-13 07:13:21,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:13:21,843 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:13:21,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:13:21,845 INFO L168 Benchmark]: Toolchain (without parser) took 17342.78 ms. Allocated memory was 96.5 MB in the beginning and 163.6 MB in the end (delta: 67.1 MB). Free memory was 74.2 MB in the beginning and 92.4 MB in the end (delta: -18.3 MB). Peak memory consumption was 47.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,845 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 96.5 MB. Free memory is still 70.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:13:21,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.36 ms. Allocated memory is still 96.5 MB. Free memory was 73.9 MB in the beginning and 58.4 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.84 ms. Allocated memory is still 96.5 MB. Free memory was 58.4 MB in the beginning and 55.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,847 INFO L168 Benchmark]: Boogie Preprocessor took 85.68 ms. Allocated memory is still 96.5 MB. Free memory was 55.3 MB in the beginning and 53.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,847 INFO L168 Benchmark]: RCFGBuilder took 2120.87 ms. Allocated memory was 96.5 MB in the beginning and 125.8 MB in the end (delta: 29.4 MB). Free memory was 53.2 MB in the beginning and 66.7 MB in the end (delta: -13.5 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,848 INFO L168 Benchmark]: TraceAbstraction took 14051.14 ms. Allocated memory was 125.8 MB in the beginning and 163.6 MB in the end (delta: 37.7 MB). Free memory was 66.7 MB in the beginning and 101.9 MB in the end (delta: -35.1 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,848 INFO L168 Benchmark]: Witness Printer took 100.27 ms. Allocated memory is still 163.6 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:13:21,851 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.29 ms. Allocated memory is still 96.5 MB. Free memory is still 70.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 866.36 ms. Allocated memory is still 96.5 MB. Free memory was 73.9 MB in the beginning and 58.4 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 107.84 ms. Allocated memory is still 96.5 MB. Free memory was 58.4 MB in the beginning and 55.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.68 ms. Allocated memory is still 96.5 MB. Free memory was 55.3 MB in the beginning and 53.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2120.87 ms. Allocated memory was 96.5 MB in the beginning and 125.8 MB in the end (delta: 29.4 MB). Free memory was 53.2 MB in the beginning and 66.7 MB in the end (delta: -13.5 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14051.14 ms. Allocated memory was 125.8 MB in the beginning and 163.6 MB in the end (delta: 37.7 MB). Free memory was 66.7 MB in the beginning and 101.9 MB in the end (delta: -35.1 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Witness Printer took 100.27 ms. Allocated memory is still 163.6 MB. Free memory was 101.9 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10363.3ms, 95 PlacesBefore, 28 PlacesAfterwards, 90 TransitionsBefore, 22 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 2912 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1640, positive: 1508, positive conditional: 0, positive unconditional: 1508, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 846, positive: 813, positive conditional: 0, positive unconditional: 813, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 846, positive: 797, positive conditional: 0, positive unconditional: 797, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 442, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 419, negative conditional: 0, negative unconditional: 419, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1640, positive: 695, positive conditional: 0, positive unconditional: 695, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 846, unknown conditional: 0, unknown unconditional: 846] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1099; [L803] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L804] 0 pthread_t t1100; [L805] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 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) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 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 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 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) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 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 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 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) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 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 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 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 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !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) [L822] 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) [L823] EXPR 0 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)) [L823] 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)) [L824] EXPR 0 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)) [L824] 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)) [L825] EXPR 0 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)) [L825] 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)) [L826] EXPR 0 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)) [L826] 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)) [L827] EXPR 0 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)) [L827] 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)) [L828] EXPR 0 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 805]: 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: 803]: 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 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 13859.9ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 20.9ms, AutomataDifference: 835.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10429.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 151 SDtfs, 185 SDslu, 285 SDs, 0 SdLazy, 157 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 407.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 433.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 140.5ms AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 57.4ms SsaConstructionTime, 734.1ms SatisfiabilityAnalysisTime, 1277.2ms InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2021-10-13 07:13:21,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dba32f13-f20b-4d51-9d70-0dd38adbe9e0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...