./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI --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 cfef585ac2bc66d073fbd66631ad28a87a9972ea .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-7b2dab5 [2021-10-11 02:27:12,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:27:12,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:27:12,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:27:12,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:27:12,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:27:12,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:27:12,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:27:12,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:27:12,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:27:12,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:27:12,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:27:12,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:27:12,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:27:12,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:27:12,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:27:12,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:27:12,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:27:12,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:27:12,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:27:12,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:27:12,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:27:12,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:27:12,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:27:12,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:27:12,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:27:12,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:27:12,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:27:12,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:27:12,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:27:12,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:27:12,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:27:12,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:27:12,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:27:12,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:27:12,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:27:12,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:27:12,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:27:12,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:27:12,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:27:12,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:27:12,179 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:27:12,218 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:27:12,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:27:12,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:27:12,225 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:27:12,225 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:27:12,225 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:27:12,225 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:27:12,232 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:27:12,232 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:27:12,232 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:27:12,233 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:27:12,234 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:27:12,234 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:27:12,234 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:27:12,234 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:27:12,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:27:12,236 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:27:12,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:27:12,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:27:12,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:27:12,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:27:12,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:27:12,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:27:12,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:27:12,237 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:27:12,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:27:12,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:27:12,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:27:12,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:27:12,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:27:12,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:27:12,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:27:12,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:27:12,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:27:12,240 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:27:12,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:27:12,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:27:12,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:27:12,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:27:12,241 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_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/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_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI 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 -> cfef585ac2bc66d073fbd66631ad28a87a9972ea [2021-10-11 02:27:12,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:27:12,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:27:12,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:27:12,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:27:12,528 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:27:12,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i [2021-10-11 02:27:12,616 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/data/bfc75ce28/e4fecabbbac644cc9111a9b015613540/FLAGd37b01c1d [2021-10-11 02:27:13,210 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:27:13,210 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i [2021-10-11 02:27:13,226 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/data/bfc75ce28/e4fecabbbac644cc9111a9b015613540/FLAGd37b01c1d [2021-10-11 02:27:13,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/data/bfc75ce28/e4fecabbbac644cc9111a9b015613540 [2021-10-11 02:27:13,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:27:13,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:27:13,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:13,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:27:13,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:27:13,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:13" (1/1) ... [2021-10-11 02:27:13,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cabf4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:13, skipping insertion in model container [2021-10-11 02:27:13,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:13" (1/1) ... [2021-10-11 02:27:13,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:27:13,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:27:13,725 WARN L226 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_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i[993,1006] [2021-10-11 02:27:13,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:13,927 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:27:13,944 WARN L226 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_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i[993,1006] [2021-10-11 02:27:14,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:14,139 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:27:14,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14 WrapperNode [2021-10-11 02:27:14,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:14,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:14,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:27:14,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:27:14,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:14,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:27:14,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:27:14,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:27:14,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... [2021-10-11 02:27:14,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:27:14,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:27:14,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:27:14,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:27:14,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 02:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:27:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:27:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 02:27:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 02:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:27:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:27:14,400 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:27:17,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:27:17,369 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-11 02:27:17,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:17 BoogieIcfgContainer [2021-10-11 02:27:17,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:27:17,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:27:17,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:27:17,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:27:17,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:27:13" (1/3) ... [2021-10-11 02:27:17,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556d7fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:17, skipping insertion in model container [2021-10-11 02:27:17,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:14" (2/3) ... [2021-10-11 02:27:17,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556d7fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:17, skipping insertion in model container [2021-10-11 02:27:17,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:17" (3/3) ... [2021-10-11 02:27:17,382 INFO L111 eAbstractionObserver]: Analyzing ICFG safe009_rmo.oepc.i [2021-10-11 02:27:17,400 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:27:17,400 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:27:17,404 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:27:17,405 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:27:17,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,486 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,486 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,486 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,487 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,500 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:27:17,519 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:27:17,530 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-11 02:27:17,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:27:17,574 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:27:17,574 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:27:17,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:27:17,575 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:27:17,575 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:27:17,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:27:17,575 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:27:17,588 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:27:17,590 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 239 flow [2021-10-11 02:27:17,593 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 239 flow [2021-10-11 02:27:17,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-10-11 02:27:17,653 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-10-11 02:27:17,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:27:17,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-10-11 02:27:17,669 INFO L116 LiptonReduction]: Number of co-enabled transitions 1418 [2021-10-11 02:27:18,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:18,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:18,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:18,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:18,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:18,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:18,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:18,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:18,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:18,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:18,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:18,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:18,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:18,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:18,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:18,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:18,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:18,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:18,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:18,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:18,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:18,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:18,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:19,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:19,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:19,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:19,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:19,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:27:19,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:19,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:19,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:27:19,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:19,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:19,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:19,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:19,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:19,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:19,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:19,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:19,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:21,364 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-10-11 02:27:21,810 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-10-11 02:27:23,736 WARN L197 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-10-11 02:27:24,652 WARN L197 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-10-11 02:27:25,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:25,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:25,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:25,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:25,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:25,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:27:25,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:25,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:25,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:25,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:25,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:25,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:25,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:25,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:25,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:25,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:25,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:25,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2021-10-11 02:27:25,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:27:26,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:26,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:26,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:26,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,176 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:27:26,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:26,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:26,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:26,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:26,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:26,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:26,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:26,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:26,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:26,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:26,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:27:26,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:26,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:26,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:26,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:26,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:26,787 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2021-10-11 02:27:26,898 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:27:27,328 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2021-10-11 02:27:27,513 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-10-11 02:27:27,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:27,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:27,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:27,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:27:27,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:27,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:27,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:27,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:27,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:27,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:27,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:27,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:27,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:27,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:27,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:27,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:28,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:28,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:28,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:27:28,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:27:28,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:28,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:28,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:28,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:27:28,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:28,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:27:28,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:28,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:28,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:27:28,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:29,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:29,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:29,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:29,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:29,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:27:29,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:29,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:27:29,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:27:29,598 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:27:29,709 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:27:29,818 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:27:29,927 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:27:30,715 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-10-11 02:27:30,829 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-10-11 02:27:30,950 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-10-11 02:27:31,064 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-10-11 02:27:31,900 WARN L197 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2021-10-11 02:27:32,223 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-10-11 02:27:32,888 WARN L197 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2021-10-11 02:27:33,275 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-10-11 02:27:33,278 INFO L131 LiptonReduction]: Checked pairs total: 3527 [2021-10-11 02:27:33,279 INFO L133 LiptonReduction]: Total number of compositions: 96 [2021-10-11 02:27:33,284 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2021-10-11 02:27:33,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 530 states. [2021-10-11 02:27:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states. [2021-10-11 02:27:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:27:33,325 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:33,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:33,326 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1389358799, now seen corresponding path program 1 times [2021-10-11 02:27:33,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:33,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366713506] [2021-10-11 02:27:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:33,513 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-11 02:27:33,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366713506] [2021-10-11 02:27:33,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:33,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:27:33,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346553090] [2021-10-11 02:27:33,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-10-11 02:27:33,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 02:27:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:27:33,534 INFO L87 Difference]: Start difference. First operand 530 states. Second operand 2 states. [2021-10-11 02:27:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:33,568 INFO L93 Difference]: Finished difference Result 530 states and 1622 transitions. [2021-10-11 02:27:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 02:27:33,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-10-11 02:27:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:33,588 INFO L225 Difference]: With dead ends: 530 [2021-10-11 02:27:33,588 INFO L226 Difference]: Without dead ends: 450 [2021-10-11 02:27:33,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:27:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-11 02:27:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-10-11 02:27:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2021-10-11 02:27:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2021-10-11 02:27:33,668 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 8 [2021-10-11 02:27:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:33,669 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2021-10-11 02:27:33,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-10-11 02:27:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2021-10-11 02:27:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:27:33,672 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:33,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:33,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:27:33,673 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash -562599527, now seen corresponding path program 1 times [2021-10-11 02:27:33,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:33,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288707017] [2021-10-11 02:27:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:34,022 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-11 02:27:34,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288707017] [2021-10-11 02:27:34,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:34,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:27:34,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29271027] [2021-10-11 02:27:34,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:27:34,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:27:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:34,026 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 5 states. [2021-10-11 02:27:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:34,082 INFO L93 Difference]: Finished difference Result 498 states and 1446 transitions. [2021-10-11 02:27:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:34,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:27:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:34,088 INFO L225 Difference]: With dead ends: 498 [2021-10-11 02:27:34,088 INFO L226 Difference]: Without dead ends: 418 [2021-10-11 02:27:34,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:27:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-10-11 02:27:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-10-11 02:27:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-10-11 02:27:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1246 transitions. [2021-10-11 02:27:34,115 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1246 transitions. Word has length 10 [2021-10-11 02:27:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:34,115 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1246 transitions. [2021-10-11 02:27:34,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:27:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1246 transitions. [2021-10-11 02:27:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:27:34,118 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:34,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:34,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:27:34,118 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash -122653245, now seen corresponding path program 1 times [2021-10-11 02:27:34,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:34,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170525952] [2021-10-11 02:27:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:34,303 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-11 02:27:34,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170525952] [2021-10-11 02:27:34,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:34,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:27:34,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283209794] [2021-10-11 02:27:34,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:27:34,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:27:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:27:34,309 INFO L87 Difference]: Start difference. First operand 418 states and 1246 transitions. Second operand 6 states. [2021-10-11 02:27:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:34,411 INFO L93 Difference]: Finished difference Result 530 states and 1522 transitions. [2021-10-11 02:27:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:27:34,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-10-11 02:27:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:34,416 INFO L225 Difference]: With dead ends: 530 [2021-10-11 02:27:34,416 INFO L226 Difference]: Without dead ends: 242 [2021-10-11 02:27:34,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-11 02:27:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-11 02:27:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-10-11 02:27:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 646 transitions. [2021-10-11 02:27:34,435 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 646 transitions. Word has length 11 [2021-10-11 02:27:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:34,436 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 646 transitions. [2021-10-11 02:27:34,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:27:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 646 transitions. [2021-10-11 02:27:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:27:34,443 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:34,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:34,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:27:34,444 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 119475071, now seen corresponding path program 1 times [2021-10-11 02:27:34,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:34,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763076087] [2021-10-11 02:27:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:34,839 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-11 02:27:34,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763076087] [2021-10-11 02:27:34,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:34,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:27:34,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546326393] [2021-10-11 02:27:34,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:27:34,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:27:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:27:34,841 INFO L87 Difference]: Start difference. First operand 242 states and 646 transitions. Second operand 7 states. [2021-10-11 02:27:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:35,015 INFO L93 Difference]: Finished difference Result 270 states and 698 transitions. [2021-10-11 02:27:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:35,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2021-10-11 02:27:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:35,018 INFO L225 Difference]: With dead ends: 270 [2021-10-11 02:27:35,018 INFO L226 Difference]: Without dead ends: 238 [2021-10-11 02:27:35,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:27:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-11 02:27:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-10-11 02:27:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-10-11 02:27:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 632 transitions. [2021-10-11 02:27:35,028 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 632 transitions. Word has length 13 [2021-10-11 02:27:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:35,029 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 632 transitions. [2021-10-11 02:27:35,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:27:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 632 transitions. [2021-10-11 02:27:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:27:35,031 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:35,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:35,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:27:35,031 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash -103680915, now seen corresponding path program 1 times [2021-10-11 02:27:35,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:35,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870605794] [2021-10-11 02:27:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:35,451 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-11 02:27:35,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870605794] [2021-10-11 02:27:35,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:35,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:27:35,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780762531] [2021-10-11 02:27:35,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:27:35,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:27:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:35,453 INFO L87 Difference]: Start difference. First operand 238 states and 632 transitions. Second operand 9 states. [2021-10-11 02:27:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:35,731 INFO L93 Difference]: Finished difference Result 358 states and 916 transitions. [2021-10-11 02:27:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:27:35,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2021-10-11 02:27:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:35,735 INFO L225 Difference]: With dead ends: 358 [2021-10-11 02:27:35,735 INFO L226 Difference]: Without dead ends: 262 [2021-10-11 02:27:35,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:27:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-11 02:27:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2021-10-11 02:27:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-10-11 02:27:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 576 transitions. [2021-10-11 02:27:35,746 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 576 transitions. Word has length 14 [2021-10-11 02:27:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:35,746 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 576 transitions. [2021-10-11 02:27:35,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:27:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 576 transitions. [2021-10-11 02:27:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:27:35,747 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:35,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:35,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:27:35,748 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -591161842, now seen corresponding path program 1 times [2021-10-11 02:27:35,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:35,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092081424] [2021-10-11 02:27:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:35,864 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-11 02:27:35,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092081424] [2021-10-11 02:27:35,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:35,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:27:35,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034881428] [2021-10-11 02:27:35,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:27:35,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:27:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:27:35,866 INFO L87 Difference]: Start difference. First operand 226 states and 576 transitions. Second operand 4 states. [2021-10-11 02:27:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:35,896 INFO L93 Difference]: Finished difference Result 226 states and 508 transitions. [2021-10-11 02:27:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:27:35,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-10-11 02:27:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:35,899 INFO L225 Difference]: With dead ends: 226 [2021-10-11 02:27:35,899 INFO L226 Difference]: Without dead ends: 178 [2021-10-11 02:27:35,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-10-11 02:27:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-10-11 02:27:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2021-10-11 02:27:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 400 transitions. [2021-10-11 02:27:35,907 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 400 transitions. Word has length 14 [2021-10-11 02:27:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:35,907 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 400 transitions. [2021-10-11 02:27:35,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:27:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 400 transitions. [2021-10-11 02:27:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:27:35,908 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:35,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:35,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:27:35,909 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1068552522, now seen corresponding path program 1 times [2021-10-11 02:27:35,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:35,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282828606] [2021-10-11 02:27:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:36,059 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-11 02:27:36,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282828606] [2021-10-11 02:27:36,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:36,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:27:36,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954907213] [2021-10-11 02:27:36,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:27:36,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:36,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:27:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:36,062 INFO L87 Difference]: Start difference. First operand 178 states and 400 transitions. Second operand 5 states. [2021-10-11 02:27:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:36,111 INFO L93 Difference]: Finished difference Result 144 states and 283 transitions. [2021-10-11 02:27:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:36,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-10-11 02:27:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:36,113 INFO L225 Difference]: With dead ends: 144 [2021-10-11 02:27:36,114 INFO L226 Difference]: Without dead ends: 114 [2021-10-11 02:27:36,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:27:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-11 02:27:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-11 02:27:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-10-11 02:27:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 218 transitions. [2021-10-11 02:27:36,119 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 218 transitions. Word has length 15 [2021-10-11 02:27:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:36,120 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 218 transitions. [2021-10-11 02:27:36,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:27:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 218 transitions. [2021-10-11 02:27:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:27:36,121 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:36,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:36,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:27:36,121 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1997483111, now seen corresponding path program 1 times [2021-10-11 02:27:36,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:36,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525090998] [2021-10-11 02:27:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:36,309 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-11 02:27:36,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525090998] [2021-10-11 02:27:36,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:36,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:27:36,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906812224] [2021-10-11 02:27:36,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:27:36,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:27:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:27:36,314 INFO L87 Difference]: Start difference. First operand 114 states and 218 transitions. Second operand 6 states. [2021-10-11 02:27:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:36,381 INFO L93 Difference]: Finished difference Result 95 states and 179 transitions. [2021-10-11 02:27:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:27:36,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-10-11 02:27:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:36,384 INFO L225 Difference]: With dead ends: 95 [2021-10-11 02:27:36,384 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:27:36,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:27:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:27:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:27:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 128 transitions. [2021-10-11 02:27:36,389 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 128 transitions. Word has length 17 [2021-10-11 02:27:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:36,389 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 128 transitions. [2021-10-11 02:27:36,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:27:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 128 transitions. [2021-10-11 02:27:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:27:36,390 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:36,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:36,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:27:36,391 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1086407887, now seen corresponding path program 1 times [2021-10-11 02:27:36,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:36,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878507540] [2021-10-11 02:27:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:27:36,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:27:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:27:36,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:27:36,671 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:27:36,672 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:27:36,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:27:36,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:36 BasicIcfg [2021-10-11 02:27:36,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:27:36,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:27:36,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:27:36,779 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:27:36,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:17" (3/4) ... [2021-10-11 02:27:36,782 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:27:36,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2295ecf1-6e6a-42e0-bf9c-db99c61a49d7/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:27:36,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:27:36,930 INFO L168 Benchmark]: Toolchain (without parser) took 23470.28 ms. Allocated memory was 121.6 MB in the beginning and 427.8 MB in the end (delta: 306.2 MB). Free memory was 86.6 MB in the beginning and 223.2 MB in the end (delta: -136.6 MB). Peak memory consumption was 169.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,930 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 83.9 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:36,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.85 ms. Allocated memory is still 121.6 MB. Free memory was 86.3 MB in the beginning and 71.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.14 ms. Allocated memory is still 121.6 MB. Free memory was 71.8 MB in the beginning and 68.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,932 INFO L168 Benchmark]: Boogie Preprocessor took 69.87 ms. Allocated memory is still 121.6 MB. Free memory was 68.8 MB in the beginning and 66.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,933 INFO L168 Benchmark]: RCFGBuilder took 3057.12 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 66.1 MB in the beginning and 55.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,933 INFO L168 Benchmark]: TraceAbstraction took 19403.51 ms. Allocated memory was 146.8 MB in the beginning and 427.8 MB in the end (delta: 281.0 MB). Free memory was 55.6 MB in the beginning and 244.2 MB in the end (delta: -188.6 MB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,933 INFO L168 Benchmark]: Witness Printer took 149.80 ms. Allocated memory is still 427.8 MB. Free memory was 244.2 MB in the beginning and 223.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:36,936 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.25 ms. Allocated memory is still 83.9 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 678.85 ms. Allocated memory is still 121.6 MB. Free memory was 86.3 MB in the beginning and 71.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.14 ms. Allocated memory is still 121.6 MB. Free memory was 71.8 MB in the beginning and 68.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.87 ms. Allocated memory is still 121.6 MB. Free memory was 68.8 MB in the beginning and 66.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3057.12 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 66.1 MB in the beginning and 55.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19403.51 ms. Allocated memory was 146.8 MB in the beginning and 427.8 MB in the end (delta: 281.0 MB). Free memory was 55.6 MB in the beginning and 244.2 MB in the end (delta: -188.6 MB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. * Witness Printer took 149.80 ms. Allocated memory is still 427.8 MB. Free memory was 244.2 MB in the beginning and 223.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 818 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 76 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.6s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 25 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 3527 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1997; [L835] FCALL, FORK 0 pthread_create(&t1997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 pthread_t t1998; [L837] FCALL, FORK 0 pthread_create(&t1998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L838] 0 pthread_t t1999; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L839] FCALL, FORK 0 pthread_create(&t1999, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 y$flush_delayed = weak$$choice2 [L855] EXPR 0 \read(y) [L855] 0 y$mem_tmp = y [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 \read(y) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 \read(y) [L865] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L866] 0 y = y$flush_delayed ? y$mem_tmp : y [L867] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.7s, HoareTripleCheckerStatistics: 163 SDtfs, 275 SDslu, 297 SDs, 0 SdLazy, 178 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 11429 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! Received shutdown request...