./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.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_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/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_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/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_d9da457c-a390-4fdc-9724-32a3cc280c02/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 2bab10cfec57f135d4a977beffe53887dc8b6e45 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:05,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:22:05,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:22:05,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:22:05,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:22:05,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:22:05,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:22:05,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:22:05,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:22:05,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:22:05,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:22:05,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:22:05,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:22:05,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:22:05,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:22:05,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:22:05,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:22:05,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:22:05,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:22:05,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:22:05,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:22:05,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:22:05,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:22:05,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:22:05,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:22:05,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:22:05,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:22:05,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:22:05,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:22:05,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:22:05,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:22:05,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:22:05,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:22:05,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:22:05,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:22:05,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:22:05,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:22:05,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:22:05,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:22:05,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:22:05,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:22:05,400 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:22:05,425 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:22:05,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:22:05,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:22:05,427 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:22:05,427 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:22:05,427 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:22:05,428 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:22:05,428 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:22:05,428 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:22:05,428 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:22:05,429 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:22:05,429 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:22:05,429 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:22:05,429 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:22:05,430 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:22:05,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:22:05,431 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:22:05,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:22:05,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:22:05,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:22:05,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:22:05,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:22:05,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:22:05,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:22:05,433 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:22:05,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:22:05,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:22:05,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:22:05,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:22:05,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:22:05,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:22:05,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:22:05,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:22:05,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:22:05,435 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:22:05,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:22:05,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:22:05,436 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:22:05,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:22:05,436 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_d9da457c-a390-4fdc-9724-32a3cc280c02/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_d9da457c-a390-4fdc-9724-32a3cc280c02/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 -> 2bab10cfec57f135d4a977beffe53887dc8b6e45 [2021-10-11 02:22:05,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:22:05,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:22:05,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:22:05,693 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:22:05,694 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:22:05,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.i [2021-10-11 02:22:05,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/data/c2608b75f/d64383359db148f2a04acdcde189132e/FLAGa71b6a3fd [2021-10-11 02:22:06,322 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:22:06,322 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.i [2021-10-11 02:22:06,342 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/data/c2608b75f/d64383359db148f2a04acdcde189132e/FLAGa71b6a3fd [2021-10-11 02:22:06,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/data/c2608b75f/d64383359db148f2a04acdcde189132e [2021-10-11 02:22:06,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:22:06,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:22:06,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:06,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:22:06,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:22:06,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:06" (1/1) ... [2021-10-11 02:22:06,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@893e736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:06, skipping insertion in model container [2021-10-11 02:22:06,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:06" (1/1) ... [2021-10-11 02:22:06,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:22:06,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:22:06,896 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_d9da457c-a390-4fdc-9724-32a3cc280c02/sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.i[948,961] [2021-10-11 02:22:07,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:07,094 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:22:07,106 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_d9da457c-a390-4fdc-9724-32a3cc280c02/sv-benchmarks/c/pthread-wmm/mix045_rmo.opt.i[948,961] [2021-10-11 02:22:07,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:07,290 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:22:07,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07 WrapperNode [2021-10-11 02:22:07,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:07,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:07,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:22:07,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:22:07,301 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:22:07" (1/1) ... [2021-10-11 02:22:07,343 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:22:07" (1/1) ... [2021-10-11 02:22:07,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:07,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:22:07,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:22:07,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:22:07,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... [2021-10-11 02:22:07,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:22:07,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:22:07,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:22:07,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:22:07,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/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:22:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:22:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:22:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:22:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:22:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:22:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:22:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:22:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:22:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 02:22:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 02:22:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:22:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:22:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:22:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:22:07,584 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:22:09,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:22:09,797 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:22:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:09 BoogieIcfgContainer [2021-10-11 02:22:09,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:22:09,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:22:09,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:22:09,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:22:09,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:22:06" (1/3) ... [2021-10-11 02:22:09,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6889ef3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:09, skipping insertion in model container [2021-10-11 02:22:09,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:07" (2/3) ... [2021-10-11 02:22:09,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6889ef3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:09, skipping insertion in model container [2021-10-11 02:22:09,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:09" (3/3) ... [2021-10-11 02:22:09,812 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2021-10-11 02:22:09,829 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:22:09,830 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:22:09,834 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:22:09,835 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:22:09,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,881 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,881 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,893 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,893 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,903 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,914 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,915 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,921 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:22:09,923 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:22:09,934 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 02:22:09,969 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:22:09,970 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:22:09,970 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:22:09,970 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:22:09,970 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:22:09,971 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:22:09,971 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:22:09,971 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:22:09,986 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:22:09,989 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2021-10-11 02:22:09,992 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2021-10-11 02:22:09,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-10-11 02:22:10,062 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-10-11 02:22:10,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:22:10,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-10-11 02:22:10,082 INFO L116 LiptonReduction]: Number of co-enabled transitions 1738 [2021-10-11 02:22:10,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:22:10,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:10,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:22:10,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:10,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:10,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:10,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:10,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:11,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:11,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:11,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:11,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:11,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:11,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:11,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:11,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:22:11,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:11,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:22:11,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:12,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:12,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:22:12,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:22:12,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:22:12,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:22:12,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:22:12,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:22:12,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:22:12,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:22:12,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:12,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:22:12,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:12,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 02:22:12,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:12,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:12,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:12,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:12,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:22:13,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:22:13,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:22:13,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:13,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:13,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:22:13,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:13,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 02:22:13,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:13,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 02:22:13,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:13,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:13,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:13,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:22:13,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2021-10-11 02:22:13,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:22:13,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:13,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:22:13,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:13,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:22:13,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:14,459 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-10-11 02:22:15,009 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-10-11 02:22:15,188 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-10-11 02:22:15,425 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-10-11 02:22:15,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:15,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:15,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:15,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:15,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:15,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:22:15,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:22:15,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:15,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:22:15,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:22:16,126 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-10-11 02:22:16,290 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-10-11 02:22:16,493 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:22:16,719 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:22:17,397 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-10-11 02:22:17,604 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-10-11 02:22:17,978 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-10-11 02:22:18,234 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-10-11 02:22:18,239 INFO L131 LiptonReduction]: Checked pairs total: 4356 [2021-10-11 02:22:18,239 INFO L133 LiptonReduction]: Total number of compositions: 85 [2021-10-11 02:22:18,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-10-11 02:22:18,299 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 890 states. [2021-10-11 02:22:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2021-10-11 02:22:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:22:18,308 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:18,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:18,309 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 650017150, now seen corresponding path program 1 times [2021-10-11 02:22:18,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:18,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513386197] [2021-10-11 02:22:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:18,553 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:22:18,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513386197] [2021-10-11 02:22:18,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:18,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:22:18,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861313690] [2021-10-11 02:22:18,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:22:18,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:22:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:22:18,576 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 3 states. [2021-10-11 02:22:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:18,650 INFO L93 Difference]: Finished difference Result 770 states and 2434 transitions. [2021-10-11 02:22:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:22:18,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-10-11 02:22:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:18,675 INFO L225 Difference]: With dead ends: 770 [2021-10-11 02:22:18,675 INFO L226 Difference]: Without dead ends: 650 [2021-10-11 02:22:18,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:22:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-11 02:22:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2021-10-11 02:22:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2021-10-11 02:22:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2021-10-11 02:22:18,789 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2021-10-11 02:22:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:18,790 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2021-10-11 02:22:18,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:22:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2021-10-11 02:22:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:22:18,793 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:18,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:18,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:22:18,794 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1345779673, now seen corresponding path program 1 times [2021-10-11 02:22:18,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:18,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267361820] [2021-10-11 02:22:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:19,044 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:22:19,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267361820] [2021-10-11 02:22:19,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:19,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:22:19,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24827685] [2021-10-11 02:22:19,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:22:19,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:22:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:22:19,047 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2021-10-11 02:22:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:19,103 INFO L93 Difference]: Finished difference Result 746 states and 2234 transitions. [2021-10-11 02:22:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:22:19,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 02:22:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:19,113 INFO L225 Difference]: With dead ends: 746 [2021-10-11 02:22:19,113 INFO L226 Difference]: Without dead ends: 626 [2021-10-11 02:22:19,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:22:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-10-11 02:22:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-10-11 02:22:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2021-10-11 02:22:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1936 transitions. [2021-10-11 02:22:19,146 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1936 transitions. Word has length 10 [2021-10-11 02:22:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:19,147 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 1936 transitions. [2021-10-11 02:22:19,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:22:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1936 transitions. [2021-10-11 02:22:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:22:19,155 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:19,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:19,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:22:19,155 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1229661487, now seen corresponding path program 1 times [2021-10-11 02:22:19,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:19,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609941039] [2021-10-11 02:22:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:19,284 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:22:19,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609941039] [2021-10-11 02:22:19,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:19,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:22:19,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146500307] [2021-10-11 02:22:19,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:22:19,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:22:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:22:19,286 INFO L87 Difference]: Start difference. First operand 626 states and 1936 transitions. Second operand 4 states. [2021-10-11 02:22:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:19,324 INFO L93 Difference]: Finished difference Result 662 states and 1972 transitions. [2021-10-11 02:22:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:22:19,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 02:22:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:19,330 INFO L225 Difference]: With dead ends: 662 [2021-10-11 02:22:19,330 INFO L226 Difference]: Without dead ends: 554 [2021-10-11 02:22:19,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:22:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-10-11 02:22:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2021-10-11 02:22:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2021-10-11 02:22:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1684 transitions. [2021-10-11 02:22:19,352 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1684 transitions. Word has length 11 [2021-10-11 02:22:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:19,352 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 1684 transitions. [2021-10-11 02:22:19,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:22:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1684 transitions. [2021-10-11 02:22:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:22:19,354 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:19,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:19,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:22:19,354 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 486945886, now seen corresponding path program 1 times [2021-10-11 02:22:19,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:19,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178519839] [2021-10-11 02:22:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:19,556 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:22:19,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178519839] [2021-10-11 02:22:19,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:19,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:22:19,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046865720] [2021-10-11 02:22:19,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:22:19,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:22:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:22:19,559 INFO L87 Difference]: Start difference. First operand 554 states and 1684 transitions. Second operand 6 states. [2021-10-11 02:22:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:19,714 INFO L93 Difference]: Finished difference Result 602 states and 1770 transitions. [2021-10-11 02:22:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:22:19,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2021-10-11 02:22:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:19,720 INFO L225 Difference]: With dead ends: 602 [2021-10-11 02:22:19,721 INFO L226 Difference]: Without dead ends: 530 [2021-10-11 02:22:19,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:22:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-11 02:22:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-10-11 02:22:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2021-10-11 02:22:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1596 transitions. [2021-10-11 02:22:19,744 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1596 transitions. Word has length 13 [2021-10-11 02:22:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:19,744 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1596 transitions. [2021-10-11 02:22:19,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:22:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1596 transitions. [2021-10-11 02:22:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:22:19,746 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:19,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:19,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:22:19,747 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2087116206, now seen corresponding path program 1 times [2021-10-11 02:22:19,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:19,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559448107] [2021-10-11 02:22:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:19,949 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:22:19,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559448107] [2021-10-11 02:22:19,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:19,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:22:19,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216091380] [2021-10-11 02:22:19,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:22:19,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:22:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:22:19,954 INFO L87 Difference]: Start difference. First operand 530 states and 1596 transitions. Second operand 7 states. [2021-10-11 02:22:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:20,231 INFO L93 Difference]: Finished difference Result 698 states and 2050 transitions. [2021-10-11 02:22:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:22:20,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2021-10-11 02:22:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:20,239 INFO L225 Difference]: With dead ends: 698 [2021-10-11 02:22:20,239 INFO L226 Difference]: Without dead ends: 626 [2021-10-11 02:22:20,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:22:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-10-11 02:22:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2021-10-11 02:22:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2021-10-11 02:22:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1816 transitions. [2021-10-11 02:22:20,267 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1816 transitions. Word has length 14 [2021-10-11 02:22:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:20,267 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1816 transitions. [2021-10-11 02:22:20,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:22:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1816 transitions. [2021-10-11 02:22:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:22:20,270 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:20,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:20,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:22:20,270 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:20,271 INFO L82 PathProgramCache]: Analyzing trace with hash -278632643, now seen corresponding path program 1 times [2021-10-11 02:22:20,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:20,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499174137] [2021-10-11 02:22:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:20,428 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:22:20,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499174137] [2021-10-11 02:22:20,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:20,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:22:20,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003174709] [2021-10-11 02:22:20,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:22:20,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:20,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:22:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:22:20,430 INFO L87 Difference]: Start difference. First operand 610 states and 1816 transitions. Second operand 7 states. [2021-10-11 02:22:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:20,638 INFO L93 Difference]: Finished difference Result 746 states and 2130 transitions. [2021-10-11 02:22:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:22:20,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2021-10-11 02:22:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:20,644 INFO L225 Difference]: With dead ends: 746 [2021-10-11 02:22:20,644 INFO L226 Difference]: Without dead ends: 618 [2021-10-11 02:22:20,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:22:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-10-11 02:22:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 482. [2021-10-11 02:22:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2021-10-11 02:22:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1408 transitions. [2021-10-11 02:22:20,665 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1408 transitions. Word has length 15 [2021-10-11 02:22:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:20,666 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1408 transitions. [2021-10-11 02:22:20,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:22:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1408 transitions. [2021-10-11 02:22:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:22:20,668 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:20,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:20,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:22:20,668 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash -195323553, now seen corresponding path program 1 times [2021-10-11 02:22:20,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:20,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608385610] [2021-10-11 02:22:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:20,815 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:22:20,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608385610] [2021-10-11 02:22:20,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:20,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:22:20,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581520454] [2021-10-11 02:22:20,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:22:20,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:22:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:22:20,817 INFO L87 Difference]: Start difference. First operand 482 states and 1408 transitions. Second operand 4 states. [2021-10-11 02:22:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:20,847 INFO L93 Difference]: Finished difference Result 462 states and 1192 transitions. [2021-10-11 02:22:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:22:20,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-10-11 02:22:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:20,851 INFO L225 Difference]: With dead ends: 462 [2021-10-11 02:22:20,851 INFO L226 Difference]: Without dead ends: 342 [2021-10-11 02:22:20,851 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:22:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-11 02:22:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-10-11 02:22:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-10-11 02:22:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 854 transitions. [2021-10-11 02:22:20,863 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 854 transitions. Word has length 15 [2021-10-11 02:22:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:20,863 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 854 transitions. [2021-10-11 02:22:20,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:22:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 854 transitions. [2021-10-11 02:22:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:22:20,865 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:20,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:20,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:22:20,865 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -686381434, now seen corresponding path program 1 times [2021-10-11 02:22:20,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:20,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255218670] [2021-10-11 02:22:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:20,979 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:22:20,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255218670] [2021-10-11 02:22:20,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:20,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:22:20,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204600132] [2021-10-11 02:22:20,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:22:20,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:22:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:22:20,982 INFO L87 Difference]: Start difference. First operand 342 states and 854 transitions. Second operand 5 states. [2021-10-11 02:22:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:21,020 INFO L93 Difference]: Finished difference Result 274 states and 626 transitions. [2021-10-11 02:22:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:22:21,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-10-11 02:22:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:21,022 INFO L225 Difference]: With dead ends: 274 [2021-10-11 02:22:21,022 INFO L226 Difference]: Without dead ends: 214 [2021-10-11 02:22:21,023 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:22:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-11 02:22:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-11 02:22:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-10-11 02:22:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 478 transitions. [2021-10-11 02:22:21,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 478 transitions. Word has length 16 [2021-10-11 02:22:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:21,030 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 478 transitions. [2021-10-11 02:22:21,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:22:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 478 transitions. [2021-10-11 02:22:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:22:21,031 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:21,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:21,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:22:21,032 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -312778827, now seen corresponding path program 1 times [2021-10-11 02:22:21,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:21,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945673008] [2021-10-11 02:22:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:21,097 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:22:21,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945673008] [2021-10-11 02:22:21,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:21,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:22:21,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204830048] [2021-10-11 02:22:21,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:22:21,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:22:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:22:21,100 INFO L87 Difference]: Start difference. First operand 214 states and 478 transitions. Second operand 4 states. [2021-10-11 02:22:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:21,134 INFO L93 Difference]: Finished difference Result 311 states and 662 transitions. [2021-10-11 02:22:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:22:21,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-10-11 02:22:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:21,136 INFO L225 Difference]: With dead ends: 311 [2021-10-11 02:22:21,136 INFO L226 Difference]: Without dead ends: 212 [2021-10-11 02:22:21,137 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:22:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-11 02:22:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2021-10-11 02:22:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-10-11 02:22:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 430 transitions. [2021-10-11 02:22:21,143 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 430 transitions. Word has length 18 [2021-10-11 02:22:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:21,144 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 430 transitions. [2021-10-11 02:22:21,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:22:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 430 transitions. [2021-10-11 02:22:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:22:21,145 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:21,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:21,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:22:21,146 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash 139713261, now seen corresponding path program 1 times [2021-10-11 02:22:21,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:21,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668553662] [2021-10-11 02:22:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:21,253 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:22:21,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668553662] [2021-10-11 02:22:21,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:21,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:22:21,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890034432] [2021-10-11 02:22:21,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:22:21,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:22:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:22:21,256 INFO L87 Difference]: Start difference. First operand 208 states and 430 transitions. Second operand 5 states. [2021-10-11 02:22:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:21,304 INFO L93 Difference]: Finished difference Result 276 states and 547 transitions. [2021-10-11 02:22:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:22:21,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-10-11 02:22:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:21,306 INFO L225 Difference]: With dead ends: 276 [2021-10-11 02:22:21,306 INFO L226 Difference]: Without dead ends: 121 [2021-10-11 02:22:21,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:22:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-11 02:22:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-10-11 02:22:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2021-10-11 02:22:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 216 transitions. [2021-10-11 02:22:21,311 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 216 transitions. Word has length 19 [2021-10-11 02:22:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:21,311 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 216 transitions. [2021-10-11 02:22:21,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:22:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 216 transitions. [2021-10-11 02:22:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:22:21,312 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:21,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:22:21,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:22:21,313 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1747260409, now seen corresponding path program 1 times [2021-10-11 02:22:21,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:21,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943827106] [2021-10-11 02:22:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:22:21,400 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:22:21,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943827106] [2021-10-11 02:22:21,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:22:21,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:22:21,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177613622] [2021-10-11 02:22:21,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:22:21,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:22:21,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:22:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:22:21,402 INFO L87 Difference]: Start difference. First operand 121 states and 216 transitions. Second operand 6 states. [2021-10-11 02:22:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:22:21,452 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2021-10-11 02:22:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:22:21,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-10-11 02:22:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:22:21,454 INFO L225 Difference]: With dead ends: 99 [2021-10-11 02:22:21,454 INFO L226 Difference]: Without dead ends: 37 [2021-10-11 02:22:21,454 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:22:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-11 02:22:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-11 02:22:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-10-11 02:22:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2021-10-11 02:22:21,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2021-10-11 02:22:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:22:21,456 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2021-10-11 02:22:21,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:22:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2021-10-11 02:22:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:22:21,457 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:22:21,458 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, 1, 1] [2021-10-11 02:22:21,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:22:21,458 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:22:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:22:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash 820692578, now seen corresponding path program 1 times [2021-10-11 02:22:21,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:22:21,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713879596] [2021-10-11 02:22:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:22:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:22:21,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:22:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:22:21,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:22:21,604 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:22:21,604 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:22:21,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:22:21,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:22:21 BasicIcfg [2021-10-11 02:22:21,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:22:21,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:22:21,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:22:21,693 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:22:21,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:09" (3/4) ... [2021-10-11 02:22:21,696 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:22:21,787 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9da457c-a390-4fdc-9724-32a3cc280c02/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:22:21,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:22:21,788 INFO L168 Benchmark]: Toolchain (without parser) took 15179.84 ms. Allocated memory was 94.4 MB in the beginning and 314.6 MB in the end (delta: 220.2 MB). Free memory was 59.8 MB in the beginning and 184.3 MB in the end (delta: -124.5 MB). Peak memory consumption was 95.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,789 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 94.4 MB. Free memory was 49.7 MB in the beginning and 49.7 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:22:21,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.19 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 46.9 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.66 ms. Allocated memory is still 94.4 MB. Free memory was 46.9 MB in the beginning and 43.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,790 INFO L168 Benchmark]: Boogie Preprocessor took 78.90 ms. Allocated memory is still 94.4 MB. Free memory was 43.8 MB in the beginning and 41.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:22:21,791 INFO L168 Benchmark]: RCFGBuilder took 2325.65 ms. Allocated memory was 94.4 MB in the beginning and 140.5 MB in the end (delta: 46.1 MB). Free memory was 41.7 MB in the beginning and 76.8 MB in the end (delta: -35.1 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,791 INFO L168 Benchmark]: TraceAbstraction took 11888.86 ms. Allocated memory was 140.5 MB in the beginning and 314.6 MB in the end (delta: 174.1 MB). Free memory was 76.8 MB in the beginning and 197.9 MB in the end (delta: -121.1 MB). Peak memory consumption was 51.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,791 INFO L168 Benchmark]: Witness Printer took 94.32 ms. Allocated memory is still 314.6 MB. Free memory was 197.9 MB in the beginning and 184.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:22:21,794 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 94.4 MB. Free memory was 49.7 MB in the beginning and 49.7 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 681.19 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 46.9 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 99.66 ms. Allocated memory is still 94.4 MB. Free memory was 46.9 MB in the beginning and 43.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.90 ms. Allocated memory is still 94.4 MB. Free memory was 43.8 MB in the beginning and 41.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2325.65 ms. Allocated memory was 94.4 MB in the beginning and 140.5 MB in the end (delta: 46.1 MB). Free memory was 41.7 MB in the beginning and 76.8 MB in the end (delta: -35.1 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11888.86 ms. Allocated memory was 140.5 MB in the beginning and 314.6 MB in the end (delta: 174.1 MB). Free memory was 76.8 MB in the beginning and 197.9 MB in the end (delta: -121.1 MB). Peak memory consumption was 51.9 MB. Max. memory is 16.1 GB. * Witness Printer took 94.32 ms. Allocated memory is still 314.6 MB. Free memory was 197.9 MB in the beginning and 184.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1099 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 108 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 4356 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1208; [L824] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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, z=0] [L825] 0 pthread_t t1209; [L826] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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, z=0] [L827] 0 pthread_t t1210; [L828] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 324 SDtfs, 461 SDslu, 598 SDs, 0 SdLazy, 221 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 156 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 9776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...