./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:23:40,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:23:40,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:23:40,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:23:40,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:23:40,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:23:40,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:23:40,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:23:40,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:23:40,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:23:40,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:23:40,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:23:40,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:23:40,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:23:40,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:23:40,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:23:40,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:23:40,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:23:40,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:23:40,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:23:40,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:23:40,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:23:40,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:23:40,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:23:40,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:23:40,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:23:40,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:23:40,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:23:40,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:23:40,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:23:40,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:23:40,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:23:40,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:23:40,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:23:40,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:23:40,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:23:40,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:23:40,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:23:40,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:23:40,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:23:40,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:23:40,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:23:40,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:23:40,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:23:40,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:23:40,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:23:40,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:23:40,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:23:40,580 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:23:40,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:23:40,581 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:23:40,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:23:40,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:23:40,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:23:40,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:23:40,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:23:40,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:23:40,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:23:40,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:23:40,583 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:23:40,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:23:40,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:23:40,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:23:40,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:23:40,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:23:40,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:23:40,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:23:40,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:23:40,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:23:40,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:23:40,589 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:23:40,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:23:40,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:23:40,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:23:40,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/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_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be 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 -> Automizer 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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b [2021-10-21 20:23:40,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:23:41,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:23:41,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:23:41,015 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:23:41,016 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:23:41,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2021-10-21 20:23:41,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/data/63353b45b/f762df2958784c2b94fd6d2484671dd7/FLAG47f5372e3 [2021-10-21 20:23:41,786 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:23:41,787 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2021-10-21 20:23:41,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/data/63353b45b/f762df2958784c2b94fd6d2484671dd7/FLAG47f5372e3 [2021-10-21 20:23:41,976 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/data/63353b45b/f762df2958784c2b94fd6d2484671dd7 [2021-10-21 20:23:41,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:23:41,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:23:41,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:23:41,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:23:41,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:23:41,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:23:41" (1/1) ... [2021-10-21 20:23:41,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cffb710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:41, skipping insertion in model container [2021-10-21 20:23:41,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:23:41" (1/1) ... [2021-10-21 20:23:42,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:23:42,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:23:42,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2021-10-21 20:23:42,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:23:42,666 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:23:42,694 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2021-10-21 20:23:42,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:23:42,859 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:23:42,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42 WrapperNode [2021-10-21 20:23:42,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:23:42,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:23:42,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:23:42,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:23:42,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:23:42,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:23:42,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:23:42,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:23:42,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:42,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:23:43,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:23:43,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:23:43,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:23:43,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (1/1) ... [2021-10-21 20:23:43,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:23:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:23:43,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:23:43,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:23:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 20:23:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-21 20:23:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:23:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 20:23:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-21 20:23:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-21 20:23:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-21 20:23:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-21 20:23:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-21 20:23:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-21 20:23:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:23:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-21 20:23:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:23:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:23:43,131 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-21 20:23:45,334 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:23:45,334 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-21 20:23:45,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:23:45 BoogieIcfgContainer [2021-10-21 20:23:45,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:23:45,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:23:45,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:23:45,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:23:45,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:23:41" (1/3) ... [2021-10-21 20:23:45,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2da101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:23:45, skipping insertion in model container [2021-10-21 20:23:45,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:23:42" (2/3) ... [2021-10-21 20:23:45,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2da101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:23:45, skipping insertion in model container [2021-10-21 20:23:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:23:45" (3/3) ... [2021-10-21 20:23:45,350 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2021-10-21 20:23:45,357 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-21 20:23:45,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:23:45,358 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 20:23:45,358 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-21 20:23:45,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,406 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,505 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:23:45,507 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-21 20:23:45,566 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:23:45,574 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:23:45,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-21 20:23:45,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2021-10-21 20:23:45,682 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2021-10-21 20:23:45,683 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:23:45,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-21 20:23:45,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2021-10-21 20:23:45,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2021-10-21 20:23:45,735 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-10-21 20:23:45,735 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:23:45,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:45,736 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:45,737 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -379956979, now seen corresponding path program 1 times [2021-10-21 20:23:45,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:45,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654683991] [2021-10-21 20:23:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:45,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:46,278 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-21 20:23:46,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:46,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654683991] [2021-10-21 20:23:46,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654683991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:46,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:46,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:23:46,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231420837] [2021-10-21 20:23:46,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:23:46,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:23:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:23:46,317 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 110 [2021-10-21 20:23:46,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:46,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:46,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 110 [2021-10-21 20:23:46,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:46,441 INFO L129 PetriNetUnfolder]: 9/140 cut-off events. [2021-10-21 20:23:46,442 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:23:46,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 140 events. 9/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 235 event pairs, 1 based on Foata normal form. 7/141 useless extension candidates. Maximal degree in co-relation 121. Up to 17 conditions per place. [2021-10-21 20:23:46,446 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 5 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2021-10-21 20:23:46,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 233 flow [2021-10-21 20:23:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:23:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-21 20:23:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2021-10-21 20:23:46,464 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2021-10-21 20:23:46,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2021-10-21 20:23:46,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2021-10-21 20:23:46,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:46,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2021-10-21 20:23:46,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:46,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:46,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:46,487 INFO L186 Difference]: Start difference. First operand has 115 places, 107 transitions, 223 flow. Second operand 3 states and 315 transitions. [2021-10-21 20:23:46,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 105 transitions, 233 flow [2021-10-21 20:23:46,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 105 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-21 20:23:46,498 INFO L242 Difference]: Finished difference. Result has 112 places, 103 transitions, 216 flow [2021-10-21 20:23:46,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2021-10-21 20:23:46,501 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2021-10-21 20:23:46,502 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 216 flow [2021-10-21 20:23:46,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:46,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:46,503 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:46,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:23:46,504 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1767684865, now seen corresponding path program 1 times [2021-10-21 20:23:46,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:46,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623829357] [2021-10-21 20:23:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:46,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:46,996 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-21 20:23:46,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:46,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623829357] [2021-10-21 20:23:46,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623829357] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:46,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:47,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 20:23:47,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825169811] [2021-10-21 20:23:47,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 20:23:47,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 20:23:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:23:47,007 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 110 [2021-10-21 20:23:47,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:47,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 110 [2021-10-21 20:23:47,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:47,481 INFO L129 PetriNetUnfolder]: 173/642 cut-off events. [2021-10-21 20:23:47,481 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:23:47,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 642 events. 173/642 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3757 event pairs, 25 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 896. Up to 139 conditions per place. [2021-10-21 20:23:47,493 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 14 selfloop transitions, 2 changer transitions 37/132 dead transitions. [2021-10-21 20:23:47,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 362 flow [2021-10-21 20:23:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:23:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 20:23:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2021-10-21 20:23:47,503 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8828282828282829 [2021-10-21 20:23:47,503 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2021-10-21 20:23:47,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2021-10-21 20:23:47,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:47,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2021-10-21 20:23:47,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,519 INFO L186 Difference]: Start difference. First operand has 112 places, 103 transitions, 216 flow. Second operand 9 states and 874 transitions. [2021-10-21 20:23:47,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 362 flow [2021-10-21 20:23:47,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 132 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-21 20:23:47,528 INFO L242 Difference]: Finished difference. Result has 125 places, 93 transitions, 212 flow [2021-10-21 20:23:47,528 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=125, PETRI_TRANSITIONS=93} [2021-10-21 20:23:47,529 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 10 predicate places. [2021-10-21 20:23:47,529 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 93 transitions, 212 flow [2021-10-21 20:23:47,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,530 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:47,531 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:47,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:23:47,531 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1885608034, now seen corresponding path program 1 times [2021-10-21 20:23:47,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:47,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385436537] [2021-10-21 20:23:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:47,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:47,833 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-21 20:23:47,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:47,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385436537] [2021-10-21 20:23:47,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385436537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:47,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:47,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:23:47,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939843432] [2021-10-21 20:23:47,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:23:47,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:23:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:23:47,845 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-10-21 20:23:47,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 93 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:47,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:47,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-10-21 20:23:47,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:48,082 INFO L129 PetriNetUnfolder]: 112/357 cut-off events. [2021-10-21 20:23:48,083 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-10-21 20:23:48,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 357 events. 112/357 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1659 event pairs, 2 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 590. Up to 81 conditions per place. [2021-10-21 20:23:48,092 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 10 selfloop transitions, 6 changer transitions 25/123 dead transitions. [2021-10-21 20:23:48,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 123 transitions, 354 flow [2021-10-21 20:23:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:23:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 20:23:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1003 transitions. [2021-10-21 20:23:48,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9118181818181819 [2021-10-21 20:23:48,121 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1003 transitions. [2021-10-21 20:23:48,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1003 transitions. [2021-10-21 20:23:48,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:48,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1003 transitions. [2021-10-21 20:23:48,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.3) internal successors, (1003), 10 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,135 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,136 INFO L186 Difference]: Start difference. First operand has 125 places, 93 transitions, 212 flow. Second operand 10 states and 1003 transitions. [2021-10-21 20:23:48,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 123 transitions, 354 flow [2021-10-21 20:23:48,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 338 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-10-21 20:23:48,148 INFO L242 Difference]: Finished difference. Result has 116 places, 95 transitions, 250 flow [2021-10-21 20:23:48,149 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=250, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2021-10-21 20:23:48,149 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2021-10-21 20:23:48,149 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 250 flow [2021-10-21 20:23:48,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:48,154 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:48,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:23:48,154 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 630222209, now seen corresponding path program 1 times [2021-10-21 20:23:48,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:48,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371817675] [2021-10-21 20:23:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:48,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:48,435 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-21 20:23:48,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:48,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371817675] [2021-10-21 20:23:48,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371817675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:48,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:48,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 20:23:48,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632859018] [2021-10-21 20:23:48,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 20:23:48,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 20:23:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:23:48,448 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-10-21 20:23:48,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:48,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-10-21 20:23:48,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:48,661 INFO L129 PetriNetUnfolder]: 52/228 cut-off events. [2021-10-21 20:23:48,661 INFO L130 PetriNetUnfolder]: For 291/318 co-relation queries the response was YES. [2021-10-21 20:23:48,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 228 events. 52/228 cut-off events. For 291/318 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 740 event pairs, 0 based on Foata normal form. 13/239 useless extension candidates. Maximal degree in co-relation 553. Up to 75 conditions per place. [2021-10-21 20:23:48,664 INFO L132 encePairwiseOnDemand]: 101/110 looper letters, 10 selfloop transitions, 9 changer transitions 19/120 dead transitions. [2021-10-21 20:23:48,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 503 flow [2021-10-21 20:23:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:23:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 20:23:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1000 transitions. [2021-10-21 20:23:48,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2021-10-21 20:23:48,670 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1000 transitions. [2021-10-21 20:23:48,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1000 transitions. [2021-10-21 20:23:48,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:48,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1000 transitions. [2021-10-21 20:23:48,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,681 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,681 INFO L186 Difference]: Start difference. First operand has 116 places, 95 transitions, 250 flow. Second operand 10 states and 1000 transitions. [2021-10-21 20:23:48,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 503 flow [2021-10-21 20:23:48,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 479 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-10-21 20:23:48,691 INFO L242 Difference]: Finished difference. Result has 120 places, 98 transitions, 318 flow [2021-10-21 20:23:48,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=318, PETRI_PLACES=120, PETRI_TRANSITIONS=98} [2021-10-21 20:23:48,692 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2021-10-21 20:23:48,693 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 98 transitions, 318 flow [2021-10-21 20:23:48,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:48,694 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:48,694 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:48,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:23:48,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2137569127, now seen corresponding path program 1 times [2021-10-21 20:23:48,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:48,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584319057] [2021-10-21 20:23:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:48,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:49,273 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-21 20:23:49,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:49,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584319057] [2021-10-21 20:23:49,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584319057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:49,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:49,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 20:23:49,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501768336] [2021-10-21 20:23:49,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 20:23:49,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 20:23:49,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-21 20:23:49,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2021-10-21 20:23:49,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 98 transitions, 318 flow. Second operand has 12 states, 12 states have (on average 82.0) internal successors, (984), 12 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:49,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:49,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2021-10-21 20:23:49,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:50,177 INFO L129 PetriNetUnfolder]: 140/579 cut-off events. [2021-10-21 20:23:50,177 INFO L130 PetriNetUnfolder]: For 924/991 co-relation queries the response was YES. [2021-10-21 20:23:50,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 579 events. 140/579 cut-off events. For 924/991 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3178 event pairs, 26 based on Foata normal form. 17/584 useless extension candidates. Maximal degree in co-relation 1374. Up to 153 conditions per place. [2021-10-21 20:23:50,188 INFO L132 encePairwiseOnDemand]: 96/110 looper letters, 41 selfloop transitions, 15 changer transitions 21/150 dead transitions. [2021-10-21 20:23:50,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 583 flow [2021-10-21 20:23:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 20:23:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-21 20:23:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1520 transitions. [2021-10-21 20:23:50,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7676767676767676 [2021-10-21 20:23:50,197 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1520 transitions. [2021-10-21 20:23:50,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1520 transitions. [2021-10-21 20:23:50,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:50,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1520 transitions. [2021-10-21 20:23:50,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 84.44444444444444) internal successors, (1520), 18 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 110.0) internal successors, (2090), 19 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,213 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 110.0) internal successors, (2090), 19 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,213 INFO L186 Difference]: Start difference. First operand has 120 places, 98 transitions, 318 flow. Second operand 18 states and 1520 transitions. [2021-10-21 20:23:50,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 583 flow [2021-10-21 20:23:50,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 150 transitions, 527 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-10-21 20:23:50,231 INFO L242 Difference]: Finished difference. Result has 137 places, 108 transitions, 377 flow [2021-10-21 20:23:50,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=377, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2021-10-21 20:23:50,231 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 22 predicate places. [2021-10-21 20:23:50,231 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 377 flow [2021-10-21 20:23:50,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.0) internal successors, (984), 12 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,233 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:50,233 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:50,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:23:50,233 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 880921563, now seen corresponding path program 2 times [2021-10-21 20:23:50,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:50,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426746445] [2021-10-21 20:23:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:50,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:50,462 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-21 20:23:50,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:50,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426746445] [2021-10-21 20:23:50,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426746445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:50,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:50,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:23:50,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278879305] [2021-10-21 20:23:50,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 20:23:50,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 20:23:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:23:50,467 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 110 [2021-10-21 20:23:50,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 377 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:50,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 110 [2021-10-21 20:23:50,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:50,753 INFO L129 PetriNetUnfolder]: 117/642 cut-off events. [2021-10-21 20:23:50,753 INFO L130 PetriNetUnfolder]: For 1274/1321 co-relation queries the response was YES. [2021-10-21 20:23:50,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 642 events. 117/642 cut-off events. For 1274/1321 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3998 event pairs, 29 based on Foata normal form. 18/648 useless extension candidates. Maximal degree in co-relation 1733. Up to 105 conditions per place. [2021-10-21 20:23:50,764 INFO L132 encePairwiseOnDemand]: 102/110 looper letters, 33 selfloop transitions, 9 changer transitions 6/133 dead transitions. [2021-10-21 20:23:50,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 689 flow [2021-10-21 20:23:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 20:23:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-10-21 20:23:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2021-10-21 20:23:50,769 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8647727272727272 [2021-10-21 20:23:50,769 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions. [2021-10-21 20:23:50,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions. [2021-10-21 20:23:50,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:50,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions. [2021-10-21 20:23:50,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,781 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,781 INFO L186 Difference]: Start difference. First operand has 137 places, 108 transitions, 377 flow. Second operand 8 states and 761 transitions. [2021-10-21 20:23:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 689 flow [2021-10-21 20:23:50,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 133 transitions, 640 flow, removed 22 selfloop flow, removed 8 redundant places. [2021-10-21 20:23:50,795 INFO L242 Difference]: Finished difference. Result has 132 places, 112 transitions, 420 flow [2021-10-21 20:23:50,796 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=132, PETRI_TRANSITIONS=112} [2021-10-21 20:23:50,796 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 17 predicate places. [2021-10-21 20:23:50,796 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 112 transitions, 420 flow [2021-10-21 20:23:50,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:50,797 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:50,797 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:50,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:23:50,798 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1418315903, now seen corresponding path program 3 times [2021-10-21 20:23:50,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:50,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891636527] [2021-10-21 20:23:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:50,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:51,009 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-21 20:23:51,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:51,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891636527] [2021-10-21 20:23:51,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891636527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:51,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:51,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:23:51,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414248657] [2021-10-21 20:23:51,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 20:23:51,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 20:23:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:23:51,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-10-21 20:23:51,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 112 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:51,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-10-21 20:23:51,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:51,270 INFO L129 PetriNetUnfolder]: 87/432 cut-off events. [2021-10-21 20:23:51,270 INFO L130 PetriNetUnfolder]: For 872/1038 co-relation queries the response was YES. [2021-10-21 20:23:51,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 432 events. 87/432 cut-off events. For 872/1038 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2272 event pairs, 4 based on Foata normal form. 89/508 useless extension candidates. Maximal degree in co-relation 1227. Up to 116 conditions per place. [2021-10-21 20:23:51,276 INFO L132 encePairwiseOnDemand]: 101/110 looper letters, 6 selfloop transitions, 14 changer transitions 23/125 dead transitions. [2021-10-21 20:23:51,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 125 transitions, 565 flow [2021-10-21 20:23:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 20:23:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-21 20:23:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1087 transitions. [2021-10-21 20:23:51,281 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8983471074380165 [2021-10-21 20:23:51,281 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1087 transitions. [2021-10-21 20:23:51,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1087 transitions. [2021-10-21 20:23:51,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:51,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1087 transitions. [2021-10-21 20:23:51,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 110.0) internal successors, (1320), 12 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,310 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 110.0) internal successors, (1320), 12 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,310 INFO L186 Difference]: Start difference. First operand has 132 places, 112 transitions, 420 flow. Second operand 11 states and 1087 transitions. [2021-10-21 20:23:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 125 transitions, 565 flow [2021-10-21 20:23:51,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 125 transitions, 521 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-10-21 20:23:51,319 INFO L242 Difference]: Finished difference. Result has 145 places, 101 transitions, 370 flow [2021-10-21 20:23:51,319 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=370, PETRI_PLACES=145, PETRI_TRANSITIONS=101} [2021-10-21 20:23:51,320 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 30 predicate places. [2021-10-21 20:23:51,320 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 101 transitions, 370 flow [2021-10-21 20:23:51,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,320 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:51,321 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:51,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:23:51,321 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1802742423, now seen corresponding path program 1 times [2021-10-21 20:23:51,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:51,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228479442] [2021-10-21 20:23:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:51,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:51,645 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-21 20:23:51,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:51,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228479442] [2021-10-21 20:23:51,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228479442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:51,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:51,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:23:51,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564180406] [2021-10-21 20:23:51,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:23:51,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:23:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:23:51,649 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2021-10-21 20:23:51,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 101 transitions, 370 flow. Second operand has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:51,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:51,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2021-10-21 20:23:51,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:52,009 INFO L129 PetriNetUnfolder]: 64/471 cut-off events. [2021-10-21 20:23:52,009 INFO L130 PetriNetUnfolder]: For 1065/1080 co-relation queries the response was YES. [2021-10-21 20:23:52,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 471 events. 64/471 cut-off events. For 1065/1080 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2939 event pairs, 2 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 1361. Up to 82 conditions per place. [2021-10-21 20:23:52,016 INFO L132 encePairwiseOnDemand]: 99/110 looper letters, 20 selfloop transitions, 5 changer transitions 18/125 dead transitions. [2021-10-21 20:23:52,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 125 transitions, 595 flow [2021-10-21 20:23:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:23:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 20:23:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1176 transitions. [2021-10-21 20:23:52,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8223776223776224 [2021-10-21 20:23:52,022 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1176 transitions. [2021-10-21 20:23:52,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1176 transitions. [2021-10-21 20:23:52,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:52,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1176 transitions. [2021-10-21 20:23:52,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.46153846153847) internal successors, (1176), 13 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,034 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,034 INFO L186 Difference]: Start difference. First operand has 145 places, 101 transitions, 370 flow. Second operand 13 states and 1176 transitions. [2021-10-21 20:23:52,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 125 transitions, 595 flow [2021-10-21 20:23:52,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 125 transitions, 450 flow, removed 62 selfloop flow, removed 18 redundant places. [2021-10-21 20:23:52,045 INFO L242 Difference]: Finished difference. Result has 139 places, 103 transitions, 342 flow [2021-10-21 20:23:52,045 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=342, PETRI_PLACES=139, PETRI_TRANSITIONS=103} [2021-10-21 20:23:52,046 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2021-10-21 20:23:52,046 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 103 transitions, 342 flow [2021-10-21 20:23:52,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,047 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:52,047 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:52,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:23:52,047 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1747315357, now seen corresponding path program 2 times [2021-10-21 20:23:52,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:52,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144422429] [2021-10-21 20:23:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:52,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:23:52,360 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-21 20:23:52,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:23:52,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144422429] [2021-10-21 20:23:52,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144422429] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:23:52,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:23:52,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:23:52,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380985767] [2021-10-21 20:23:52,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:23:52,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:23:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:23:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:23:52,364 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 110 [2021-10-21 20:23:52,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 103 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 89.88888888888889) internal successors, (809), 9 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:23:52,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 110 [2021-10-21 20:23:52,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:23:52,641 INFO L129 PetriNetUnfolder]: 39/360 cut-off events. [2021-10-21 20:23:52,641 INFO L130 PetriNetUnfolder]: For 244/247 co-relation queries the response was YES. [2021-10-21 20:23:52,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 360 events. 39/360 cut-off events. For 244/247 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1973 event pairs, 3 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 795. Up to 45 conditions per place. [2021-10-21 20:23:52,644 INFO L132 encePairwiseOnDemand]: 101/110 looper letters, 14 selfloop transitions, 4 changer transitions 11/111 dead transitions. [2021-10-21 20:23:52,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 111 transitions, 442 flow [2021-10-21 20:23:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:23:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 20:23:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 905 transitions. [2021-10-21 20:23:52,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8227272727272728 [2021-10-21 20:23:52,654 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 905 transitions. [2021-10-21 20:23:52,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 905 transitions. [2021-10-21 20:23:52,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:23:52,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 905 transitions. [2021-10-21 20:23:52,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,663 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,663 INFO L186 Difference]: Start difference. First operand has 139 places, 103 transitions, 342 flow. Second operand 10 states and 905 transitions. [2021-10-21 20:23:52,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 111 transitions, 442 flow [2021-10-21 20:23:52,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 111 transitions, 387 flow, removed 20 selfloop flow, removed 12 redundant places. [2021-10-21 20:23:52,670 INFO L242 Difference]: Finished difference. Result has 133 places, 100 transitions, 306 flow [2021-10-21 20:23:52,671 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=133, PETRI_TRANSITIONS=100} [2021-10-21 20:23:52,671 INFO L334 CegarLoopForPetriNet]: 115 programPoint places, 18 predicate places. [2021-10-21 20:23:52,671 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 100 transitions, 306 flow [2021-10-21 20:23:52,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.88888888888889) internal successors, (809), 9 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:23:52,672 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:23:52,672 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:23:52,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:23:52,673 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:23:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:23:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2091418063, now seen corresponding path program 3 times [2021-10-21 20:23:52,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:23:52,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662310312] [2021-10-21 20:23:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:23:52,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:23:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:23:52,722 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:23:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:23:52,825 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:23:52,825 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 20:23:52,826 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:23:52,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:23:52,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-21 20:23:52,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-21 20:23:52,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-21 20:23:52,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:23:52,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:23:52,838 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-21 20:23:52,839 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:23:53,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:23:53 BasicIcfg [2021-10-21 20:23:53,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:23:53,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:23:53,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:23:53,109 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:23:53,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:23:45" (3/4) ... [2021-10-21 20:23:53,113 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 20:23:53,408 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:23:53,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:23:53,410 INFO L168 Benchmark]: Toolchain (without parser) took 11429.48 ms. Allocated memory was 113.2 MB in the beginning and 226.5 MB in the end (delta: 113.2 MB). Free memory was 70.1 MB in the beginning and 166.0 MB in the end (delta: -95.9 MB). Peak memory consumption was 97.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,411 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 87.8 MB in the end (delta: 53.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:23:53,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.88 ms. Allocated memory is still 113.2 MB. Free memory was 69.9 MB in the beginning and 73.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.28 ms. Allocated memory is still 113.2 MB. Free memory was 73.6 MB in the beginning and 71.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,413 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 113.2 MB. Free memory was 71.0 MB in the beginning and 68.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,414 INFO L168 Benchmark]: RCFGBuilder took 2337.79 ms. Allocated memory was 113.2 MB in the beginning and 153.1 MB in the end (delta: 39.8 MB). Free memory was 68.9 MB in the beginning and 75.4 MB in the end (delta: -6.5 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,414 INFO L168 Benchmark]: TraceAbstraction took 7765.76 ms. Allocated memory was 153.1 MB in the beginning and 188.7 MB in the end (delta: 35.7 MB). Free memory was 74.2 MB in the beginning and 56.2 MB in the end (delta: 18.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,415 INFO L168 Benchmark]: Witness Printer took 300.41 ms. Allocated memory was 188.7 MB in the beginning and 226.5 MB in the end (delta: 37.7 MB). Free memory was 56.2 MB in the beginning and 166.0 MB in the end (delta: -109.8 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2021-10-21 20:23:53,418 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.40 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 87.8 MB in the end (delta: 53.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 872.88 ms. Allocated memory is still 113.2 MB. Free memory was 69.9 MB in the beginning and 73.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.28 ms. Allocated memory is still 113.2 MB. Free memory was 73.6 MB in the beginning and 71.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 113.2 MB. Free memory was 71.0 MB in the beginning and 68.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2337.79 ms. Allocated memory was 113.2 MB in the beginning and 153.1 MB in the end (delta: 39.8 MB). Free memory was 68.9 MB in the beginning and 75.4 MB in the end (delta: -6.5 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7765.76 ms. Allocated memory was 153.1 MB in the beginning and 188.7 MB in the end (delta: 35.7 MB). Free memory was 74.2 MB in the beginning and 56.2 MB in the end (delta: 18.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 16.1 GB. * Witness Printer took 300.41 ms. Allocated memory was 188.7 MB in the beginning and 226.5 MB in the end (delta: 37.7 MB). Free memory was 56.2 MB in the beginning and 166.0 MB in the end (delta: -109.8 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L737] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L738] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L739] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L740] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L741] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L835] 0 pthread_t t922; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L837] 0 pthread_t t923; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L839] 0 pthread_t t924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 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) [L813] 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) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 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 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 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) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] 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) [L846] 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) [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 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 [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L850] 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 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 34.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7273.9ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3573.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 126.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 134 SDtfs, 260 SDslu, 522 SDs, 0 SdLazy, 607 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 768.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1397.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=6, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 73.5ms SsaConstructionTime, 727.2ms SatisfiabilityAnalysisTime, 2277.4ms InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 3556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-21 20:23:53,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab47e15a-9ba7-487c-a72a-bc54f4f25c2b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...