./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa --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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:06:39,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:06:39,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:06:39,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:06:39,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:06:39,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:06:39,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:06:39,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:06:39,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:06:39,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:06:39,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:06:39,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:06:39,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:06:39,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:06:39,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:06:39,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:06:39,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:06:39,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:06:39,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:06:39,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:06:39,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:06:39,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:06:39,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:06:39,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:06:39,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:06:39,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:06:39,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:06:39,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:06:39,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:06:39,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:06:39,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:06:39,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:06:39,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:06:39,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:06:39,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:06:39,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:06:39,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:06:39,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:06:39,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:06:39,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:06:39,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:06:39,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 20:06:39,100 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:06:39,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:06:39,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:06:39,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:06:39,102 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:06:39,102 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:06:39,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:06:39,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:06:39,103 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:06:39,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:06:39,103 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:06:39,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:06:39,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:06:39,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:06:39,105 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:06:39,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:06:39,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:06:39,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:06:39,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:06:39,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:06:39,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:06:39,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:06:39,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:06:39,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:06:39,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:06:39,106 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:06:39,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:06:39,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:06:39,107 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:06:39,107 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_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/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_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2021-12-06 20:06:39,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:06:39,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:06:39,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:06:39,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:06:39,314 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:06:39,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2021-12-06 20:06:39,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/data/1028db547/e4f03c959da44eeca1d72e305dc19d84/FLAGcce9113a4 [2021-12-06 20:06:39,821 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:06:39,822 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2021-12-06 20:06:39,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/data/1028db547/e4f03c959da44eeca1d72e305dc19d84/FLAGcce9113a4 [2021-12-06 20:06:39,843 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/data/1028db547/e4f03c959da44eeca1d72e305dc19d84 [2021-12-06 20:06:39,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:06:39,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:06:39,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:06:39,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:06:39,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:06:39,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:06:39" (1/1) ... [2021-12-06 20:06:39,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68575434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:39, skipping insertion in model container [2021-12-06 20:06:39,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:06:39" (1/1) ... [2021-12-06 20:06:39,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:06:39,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:06:40,023 WARN L230 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_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2021-12-06 20:06:40,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:06:40,147 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:06:40,155 WARN L230 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_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2021-12-06 20:06:40,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:06:40,217 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:06:40,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40 WrapperNode [2021-12-06 20:06:40,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:06:40,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:06:40,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:06:40,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:06:40,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,263 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 277 [2021-12-06 20:06:40,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:06:40,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:06:40,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:06:40,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:06:40,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:06:40,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:06:40,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:06:40,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:06:40,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (1/1) ... [2021-12-06 20:06:40,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:06:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:06:40,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:06:40,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:06:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 20:06:40,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 20:06:40,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 20:06:40,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:06:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 20:06:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:06:40,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:06:40,355 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 20:06:40,455 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:06:40,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:06:40,829 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:06:41,095 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:06:41,095 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 20:06:41,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:06:41 BoogieIcfgContainer [2021-12-06 20:06:41,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:06:41,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:06:41,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:06:41,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:06:41,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:06:39" (1/3) ... [2021-12-06 20:06:41,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8ec13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:06:41, skipping insertion in model container [2021-12-06 20:06:41,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:06:40" (2/3) ... [2021-12-06 20:06:41,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8ec13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:06:41, skipping insertion in model container [2021-12-06 20:06:41,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:06:41" (3/3) ... [2021-12-06 20:06:41,103 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2021-12-06 20:06:41,107 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 20:06:41,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:06:41,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 20:06:41,107 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 20:06:41,137 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,137 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,137 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,137 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,138 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,139 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,139 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,139 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,139 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,139 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,140 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,140 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,140 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,140 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,140 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,141 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,141 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,141 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,141 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,142 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,142 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,142 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,143 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,144 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,145 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,145 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,145 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,145 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,146 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,149 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,149 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,150 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,152 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,152 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,152 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,152 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,157 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,157 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,160 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,161 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,162 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,162 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,162 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,163 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,163 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,163 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,163 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,163 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,164 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,164 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,164 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,164 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,164 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:06:41,165 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 20:06:41,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:06:41,211 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-12-06 20:06:41,211 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 20:06:41,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2021-12-06 20:06:41,255 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-12-06 20:06:41,255 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 20:06:41,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-12-06 20:06:41,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2021-12-06 20:06:41,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2021-12-06 20:06:41,272 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2021-12-06 20:06:41,272 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 20:06:41,272 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:41,273 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] [2021-12-06 20:06:41,273 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1046434637, now seen corresponding path program 1 times [2021-12-06 20:06:41,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:41,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285207842] [2021-12-06 20:06:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:41,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:41,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285207842] [2021-12-06 20:06:41,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285207842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:41,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:41,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:06:41,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510112718] [2021-12-06 20:06:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:41,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:06:41,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:06:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:06:41,537 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2021-12-06 20:06:41,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-12-06 20:06:41,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:41,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2021-12-06 20:06:41,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:41,711 INFO L129 PetriNetUnfolder]: 57/490 cut-off events. [2021-12-06 20:06:41,711 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-06 20:06:41,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 490 events. 57/490 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2562 event pairs, 31 based on Foata normal form. 16/476 useless extension candidates. Maximal degree in co-relation 561. Up to 75 conditions per place. [2021-12-06 20:06:41,717 INFO L132 encePairwiseOnDemand]: 114/119 looper letters, 13 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2021-12-06 20:06:41,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 276 flow [2021-12-06 20:06:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:06:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 20:06:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2021-12-06 20:06:41,728 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2021-12-06 20:06:41,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2021-12-06 20:06:41,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2021-12-06 20:06:41,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:41,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2021-12-06 20:06:41,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-12-06 20:06:41,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-12-06 20:06:41,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-12-06 20:06:41,741 INFO L186 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 335 transitions. [2021-12-06 20:06:41,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 276 flow [2021-12-06 20:06:41,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 20:06:41,749 INFO L242 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2021-12-06 20:06:41,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2021-12-06 20:06:41,753 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2021-12-06 20:06:41,753 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2021-12-06 20:06:41,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-12-06 20:06:41,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:41,754 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] [2021-12-06 20:06:41,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:06:41,754 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 557570046, now seen corresponding path program 1 times [2021-12-06 20:06:41,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:41,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108125892] [2021-12-06 20:06:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:41,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:41,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:41,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108125892] [2021-12-06 20:06:41,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108125892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:41,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:41,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:06:41,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462331233] [2021-12-06 20:06:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:41,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:06:41,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:06:41,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:06:41,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 119 [2021-12-06 20:06:41,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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-12-06 20:06:41,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:41,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 119 [2021-12-06 20:06:41,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:42,317 INFO L129 PetriNetUnfolder]: 330/1079 cut-off events. [2021-12-06 20:06:42,317 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2021-12-06 20:06:42,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1079 events. 330/1079 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7274 event pairs, 53 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1653. Up to 257 conditions per place. [2021-12-06 20:06:42,323 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 18 selfloop transitions, 2 changer transitions 45/149 dead transitions. [2021-12-06 20:06:42,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 149 transitions, 430 flow [2021-12-06 20:06:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:06:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 20:06:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions. [2021-12-06 20:06:42,329 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8758169934640523 [2021-12-06 20:06:42,329 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions. [2021-12-06 20:06:42,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions. [2021-12-06 20:06:42,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:42,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions. [2021-12-06 20:06:42,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.22222222222223) internal successors, (938), 9 states have internal predecessors, (938), 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-12-06 20:06:42,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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-12-06 20:06:42,338 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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-12-06 20:06:42,338 INFO L186 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 938 transitions. [2021-12-06 20:06:42,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 149 transitions, 430 flow [2021-12-06 20:06:42,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 149 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 20:06:42,342 INFO L242 Difference]: Finished difference. Result has 134 places, 100 transitions, 226 flow [2021-12-06 20:06:42,342 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=134, PETRI_TRANSITIONS=100} [2021-12-06 20:06:42,343 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2021-12-06 20:06:42,343 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 100 transitions, 226 flow [2021-12-06 20:06:42,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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-12-06 20:06:42,344 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:42,344 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] [2021-12-06 20:06:42,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:06:42,344 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1981744068, now seen corresponding path program 1 times [2021-12-06 20:06:42,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:42,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824794921] [2021-12-06 20:06:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:42,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:42,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:42,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824794921] [2021-12-06 20:06:42,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824794921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:42,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:42,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:06:42,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321964914] [2021-12-06 20:06:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:42,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:06:42,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:06:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:06:42,552 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-06 20:06:42,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 100 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 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-12-06 20:06:42,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:42,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-06 20:06:42,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:42,984 INFO L129 PetriNetUnfolder]: 314/769 cut-off events. [2021-12-06 20:06:42,984 INFO L130 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2021-12-06 20:06:42,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 769 events. 314/769 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4200 event pairs, 132 based on Foata normal form. 18/769 useless extension candidates. Maximal degree in co-relation 1451. Up to 319 conditions per place. [2021-12-06 20:06:42,992 INFO L132 encePairwiseOnDemand]: 107/119 looper letters, 20 selfloop transitions, 10 changer transitions 44/155 dead transitions. [2021-12-06 20:06:42,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 518 flow [2021-12-06 20:06:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:06:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 20:06:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1502 transitions. [2021-12-06 20:06:42,997 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8414565826330532 [2021-12-06 20:06:42,998 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1502 transitions. [2021-12-06 20:06:42,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1502 transitions. [2021-12-06 20:06:42,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:42,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1502 transitions. [2021-12-06 20:06:43,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 100.13333333333334) internal successors, (1502), 15 states have internal predecessors, (1502), 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-12-06 20:06:43,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 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-12-06 20:06:43,008 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 119.0) internal successors, (1904), 16 states have internal predecessors, (1904), 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-12-06 20:06:43,008 INFO L186 Difference]: Start difference. First operand has 134 places, 100 transitions, 226 flow. Second operand 15 states and 1502 transitions. [2021-12-06 20:06:43,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 518 flow [2021-12-06 20:06:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 155 transitions, 478 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-12-06 20:06:43,016 INFO L242 Difference]: Finished difference. Result has 133 places, 106 transitions, 294 flow [2021-12-06 20:06:43,017 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=294, PETRI_PLACES=133, PETRI_TRANSITIONS=106} [2021-12-06 20:06:43,017 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2021-12-06 20:06:43,017 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 106 transitions, 294 flow [2021-12-06 20:06:43,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 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-12-06 20:06:43,018 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:43,018 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-12-06 20:06:43,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:06:43,018 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash 8601691, now seen corresponding path program 1 times [2021-12-06 20:06:43,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:43,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625195457] [2021-12-06 20:06:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:43,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:43,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625195457] [2021-12-06 20:06:43,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625195457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:43,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:43,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:06:43,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937787000] [2021-12-06 20:06:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:43,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:06:43,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:06:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:06:43,218 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2021-12-06 20:06:43,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 106 transitions, 294 flow. Second operand has 11 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 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-12-06 20:06:43,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:43,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2021-12-06 20:06:43,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:43,582 INFO L129 PetriNetUnfolder]: 232/654 cut-off events. [2021-12-06 20:06:43,582 INFO L130 PetriNetUnfolder]: For 1184/1186 co-relation queries the response was YES. [2021-12-06 20:06:43,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 654 events. 232/654 cut-off events. For 1184/1186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3387 event pairs, 146 based on Foata normal form. 11/637 useless extension candidates. Maximal degree in co-relation 1770. Up to 304 conditions per place. [2021-12-06 20:06:43,588 INFO L132 encePairwiseOnDemand]: 106/119 looper letters, 24 selfloop transitions, 15 changer transitions 34/153 dead transitions. [2021-12-06 20:06:43,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 153 transitions, 731 flow [2021-12-06 20:06:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:06:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 20:06:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1573 transitions. [2021-12-06 20:06:43,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8261554621848739 [2021-12-06 20:06:43,594 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1573 transitions. [2021-12-06 20:06:43,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1573 transitions. [2021-12-06 20:06:43,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:43,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1573 transitions. [2021-12-06 20:06:43,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.3125) internal successors, (1573), 16 states have internal predecessors, (1573), 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-12-06 20:06:43,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-12-06 20:06:43,607 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-12-06 20:06:43,607 INFO L186 Difference]: Start difference. First operand has 133 places, 106 transitions, 294 flow. Second operand 16 states and 1573 transitions. [2021-12-06 20:06:43,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 153 transitions, 731 flow [2021-12-06 20:06:43,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 153 transitions, 709 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-12-06 20:06:43,615 INFO L242 Difference]: Finished difference. Result has 145 places, 114 transitions, 423 flow [2021-12-06 20:06:43,616 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=423, PETRI_PLACES=145, PETRI_TRANSITIONS=114} [2021-12-06 20:06:43,617 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 21 predicate places. [2021-12-06 20:06:43,617 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 114 transitions, 423 flow [2021-12-06 20:06:43,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 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-12-06 20:06:43,618 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:43,618 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] [2021-12-06 20:06:43,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:06:43,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1435846694, now seen corresponding path program 1 times [2021-12-06 20:06:43,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:43,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96018089] [2021-12-06 20:06:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:43,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:43,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:43,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96018089] [2021-12-06 20:06:43,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96018089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:43,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:43,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:06:43,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721770583] [2021-12-06 20:06:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:43,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:06:43,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:06:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:06:43,792 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-06 20:06:43,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 114 transitions, 423 flow. Second operand has 10 states, 10 states have (on average 96.5) internal successors, (965), 10 states have internal predecessors, (965), 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-12-06 20:06:43,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:43,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-06 20:06:43,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:44,156 INFO L129 PetriNetUnfolder]: 224/646 cut-off events. [2021-12-06 20:06:44,156 INFO L130 PetriNetUnfolder]: For 3335/3367 co-relation queries the response was YES. [2021-12-06 20:06:44,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 646 events. 224/646 cut-off events. For 3335/3367 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3284 event pairs, 66 based on Foata normal form. 16/637 useless extension candidates. Maximal degree in co-relation 2223. Up to 227 conditions per place. [2021-12-06 20:06:44,176 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 32 selfloop transitions, 8 changer transitions 25/146 dead transitions. [2021-12-06 20:06:44,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 787 flow [2021-12-06 20:06:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:06:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 20:06:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1196 transitions. [2021-12-06 20:06:44,179 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8375350140056023 [2021-12-06 20:06:44,179 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1196 transitions. [2021-12-06 20:06:44,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1196 transitions. [2021-12-06 20:06:44,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:44,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1196 transitions. [2021-12-06 20:06:44,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.66666666666667) internal successors, (1196), 12 states have internal predecessors, (1196), 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-12-06 20:06:44,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 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-12-06 20:06:44,186 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 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-12-06 20:06:44,186 INFO L186 Difference]: Start difference. First operand has 145 places, 114 transitions, 423 flow. Second operand 12 states and 1196 transitions. [2021-12-06 20:06:44,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 787 flow [2021-12-06 20:06:44,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 669 flow, removed 56 selfloop flow, removed 12 redundant places. [2021-12-06 20:06:44,192 INFO L242 Difference]: Finished difference. Result has 142 places, 114 transitions, 404 flow [2021-12-06 20:06:44,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=404, PETRI_PLACES=142, PETRI_TRANSITIONS=114} [2021-12-06 20:06:44,193 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places. [2021-12-06 20:06:44,193 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 114 transitions, 404 flow [2021-12-06 20:06:44,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.5) internal successors, (965), 10 states have internal predecessors, (965), 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-12-06 20:06:44,194 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:44,194 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] [2021-12-06 20:06:44,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:06:44,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1432938183, now seen corresponding path program 1 times [2021-12-06 20:06:44,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:44,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347236722] [2021-12-06 20:06:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:44,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:44,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347236722] [2021-12-06 20:06:44,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347236722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:44,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:44,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:06:44,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9286049] [2021-12-06 20:06:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:44,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:06:44,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:06:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:06:44,269 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-06 20:06:44,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 114 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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-12-06 20:06:44,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:44,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-06 20:06:44,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:44,670 INFO L129 PetriNetUnfolder]: 873/1914 cut-off events. [2021-12-06 20:06:44,671 INFO L130 PetriNetUnfolder]: For 4304/4337 co-relation queries the response was YES. [2021-12-06 20:06:44,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 1914 events. 873/1914 cut-off events. For 4304/4337 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13056 event pairs, 54 based on Foata normal form. 7/1868 useless extension candidates. Maximal degree in co-relation 5310. Up to 523 conditions per place. [2021-12-06 20:06:44,684 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 53 selfloop transitions, 13 changer transitions 44/194 dead transitions. [2021-12-06 20:06:44,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 194 transitions, 1074 flow [2021-12-06 20:06:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:06:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 20:06:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2021-12-06 20:06:44,687 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8672268907563025 [2021-12-06 20:06:44,687 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2021-12-06 20:06:44,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2021-12-06 20:06:44,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:44,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2021-12-06 20:06:44,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 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-12-06 20:06:44,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-12-06 20:06:44,693 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-12-06 20:06:44,693 INFO L186 Difference]: Start difference. First operand has 142 places, 114 transitions, 404 flow. Second operand 10 states and 1032 transitions. [2021-12-06 20:06:44,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 194 transitions, 1074 flow [2021-12-06 20:06:44,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 194 transitions, 954 flow, removed 41 selfloop flow, removed 13 redundant places. [2021-12-06 20:06:44,712 INFO L242 Difference]: Finished difference. Result has 138 places, 123 transitions, 449 flow [2021-12-06 20:06:44,712 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=449, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2021-12-06 20:06:44,713 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places. [2021-12-06 20:06:44,713 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 449 flow [2021-12-06 20:06:44,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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-12-06 20:06:44,714 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:44,714 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] [2021-12-06 20:06:44,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:06:44,714 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -918310528, now seen corresponding path program 1 times [2021-12-06 20:06:44,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:44,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915679657] [2021-12-06 20:06:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:44,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:44,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:44,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915679657] [2021-12-06 20:06:44,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915679657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:44,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:44,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:06:44,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243188967] [2021-12-06 20:06:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:44,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:06:44,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:06:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:06:44,817 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-06 20:06:44,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 449 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-12-06 20:06:44,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:44,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-06 20:06:44,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:45,263 INFO L129 PetriNetUnfolder]: 731/1753 cut-off events. [2021-12-06 20:06:45,264 INFO L130 PetriNetUnfolder]: For 3481/3526 co-relation queries the response was YES. [2021-12-06 20:06:45,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5380 conditions, 1753 events. 731/1753 cut-off events. For 3481/3526 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12641 event pairs, 58 based on Foata normal form. 45/1773 useless extension candidates. Maximal degree in co-relation 5302. Up to 302 conditions per place. [2021-12-06 20:06:45,274 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 59 selfloop transitions, 24 changer transitions 50/217 dead transitions. [2021-12-06 20:06:45,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 217 transitions, 1288 flow [2021-12-06 20:06:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:06:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 20:06:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1340 transitions. [2021-12-06 20:06:45,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8661926308985133 [2021-12-06 20:06:45,278 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1340 transitions. [2021-12-06 20:06:45,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1340 transitions. [2021-12-06 20:06:45,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:45,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1340 transitions. [2021-12-06 20:06:45,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 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-12-06 20:06:45,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-12-06 20:06:45,285 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-12-06 20:06:45,285 INFO L186 Difference]: Start difference. First operand has 138 places, 123 transitions, 449 flow. Second operand 13 states and 1340 transitions. [2021-12-06 20:06:45,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 217 transitions, 1288 flow [2021-12-06 20:06:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 217 transitions, 1270 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-06 20:06:45,293 INFO L242 Difference]: Finished difference. Result has 154 places, 136 transitions, 628 flow [2021-12-06 20:06:45,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=628, PETRI_PLACES=154, PETRI_TRANSITIONS=136} [2021-12-06 20:06:45,294 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 30 predicate places. [2021-12-06 20:06:45,294 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 136 transitions, 628 flow [2021-12-06 20:06:45,295 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-12-06 20:06:45,295 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:45,295 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, 1, 1] [2021-12-06 20:06:45,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:06:45,295 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -78411431, now seen corresponding path program 1 times [2021-12-06 20:06:45,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728419454] [2021-12-06 20:06:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:45,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:45,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:45,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728419454] [2021-12-06 20:06:45,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728419454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:45,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:45,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:06:45,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891176671] [2021-12-06 20:06:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:45,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:06:45,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:06:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:06:45,387 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-06 20:06:45,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 136 transitions, 628 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-12-06 20:06:45,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:45,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-06 20:06:45,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:45,827 INFO L129 PetriNetUnfolder]: 631/1617 cut-off events. [2021-12-06 20:06:45,827 INFO L130 PetriNetUnfolder]: For 4611/4660 co-relation queries the response was YES. [2021-12-06 20:06:45,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1617 events. 631/1617 cut-off events. For 4611/4660 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12322 event pairs, 58 based on Foata normal form. 26/1618 useless extension candidates. Maximal degree in co-relation 5437. Up to 235 conditions per place. [2021-12-06 20:06:45,841 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 51 selfloop transitions, 28 changer transitions 50/213 dead transitions. [2021-12-06 20:06:45,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 213 transitions, 1364 flow [2021-12-06 20:06:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:06:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 20:06:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1614 transitions. [2021-12-06 20:06:45,846 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8476890756302521 [2021-12-06 20:06:45,846 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1614 transitions. [2021-12-06 20:06:45,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1614 transitions. [2021-12-06 20:06:45,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:45,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1614 transitions. [2021-12-06 20:06:45,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 100.875) internal successors, (1614), 16 states have internal predecessors, (1614), 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-12-06 20:06:45,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-12-06 20:06:45,858 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-12-06 20:06:45,858 INFO L186 Difference]: Start difference. First operand has 154 places, 136 transitions, 628 flow. Second operand 16 states and 1614 transitions. [2021-12-06 20:06:45,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 213 transitions, 1364 flow [2021-12-06 20:06:45,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 213 transitions, 1215 flow, removed 62 selfloop flow, removed 9 redundant places. [2021-12-06 20:06:45,886 INFO L242 Difference]: Finished difference. Result has 167 places, 137 transitions, 637 flow [2021-12-06 20:06:45,886 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=637, PETRI_PLACES=167, PETRI_TRANSITIONS=137} [2021-12-06 20:06:45,887 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 43 predicate places. [2021-12-06 20:06:45,887 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 137 transitions, 637 flow [2021-12-06 20:06:45,887 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-12-06 20:06:45,887 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:45,887 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:06:45,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:06:45,888 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1144530616, now seen corresponding path program 1 times [2021-12-06 20:06:45,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264320956] [2021-12-06 20:06:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:45,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:45,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264320956] [2021-12-06 20:06:45,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264320956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:45,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:45,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:06:45,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028592469] [2021-12-06 20:06:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:45,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:06:45,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:06:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:06:45,980 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2021-12-06 20:06:45,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 137 transitions, 637 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-12-06 20:06:45,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:45,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2021-12-06 20:06:45,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:46,203 INFO L129 PetriNetUnfolder]: 224/1281 cut-off events. [2021-12-06 20:06:46,203 INFO L130 PetriNetUnfolder]: For 2746/2914 co-relation queries the response was YES. [2021-12-06 20:06:46,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1281 events. 224/1281 cut-off events. For 2746/2914 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12305 event pairs, 17 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 3760. Up to 173 conditions per place. [2021-12-06 20:06:46,212 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 30 selfloop transitions, 1 changer transitions 18/162 dead transitions. [2021-12-06 20:06:46,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 162 transitions, 856 flow [2021-12-06 20:06:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:06:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:06:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2021-12-06 20:06:46,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8475390156062425 [2021-12-06 20:06:46,214 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2021-12-06 20:06:46,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2021-12-06 20:06:46,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:46,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2021-12-06 20:06:46,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 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-12-06 20:06:46,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-12-06 20:06:46,218 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-12-06 20:06:46,218 INFO L186 Difference]: Start difference. First operand has 167 places, 137 transitions, 637 flow. Second operand 7 states and 706 transitions. [2021-12-06 20:06:46,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 162 transitions, 856 flow [2021-12-06 20:06:46,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 766 flow, removed 15 selfloop flow, removed 15 redundant places. [2021-12-06 20:06:46,237 INFO L242 Difference]: Finished difference. Result has 160 places, 137 transitions, 560 flow [2021-12-06 20:06:46,237 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=560, PETRI_PLACES=160, PETRI_TRANSITIONS=137} [2021-12-06 20:06:46,237 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 36 predicate places. [2021-12-06 20:06:46,237 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 137 transitions, 560 flow [2021-12-06 20:06:46,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-12-06 20:06:46,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:46,238 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:06:46,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:06:46,238 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -128425870, now seen corresponding path program 2 times [2021-12-06 20:06:46,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:46,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304732721] [2021-12-06 20:06:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:46,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:06:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:06:46,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:06:46,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304732721] [2021-12-06 20:06:46,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304732721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:06:46,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:06:46,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:06:46,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837754921] [2021-12-06 20:06:46,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:06:46,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:06:46,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:06:46,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:06:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:06:46,334 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2021-12-06 20:06:46,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 137 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-12-06 20:06:46,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:06:46,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2021-12-06 20:06:46,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:06:46,574 INFO L129 PetriNetUnfolder]: 214/1396 cut-off events. [2021-12-06 20:06:46,574 INFO L130 PetriNetUnfolder]: For 1437/1455 co-relation queries the response was YES. [2021-12-06 20:06:46,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3425 conditions, 1396 events. 214/1396 cut-off events. For 1437/1455 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13784 event pairs, 29 based on Foata normal form. 5/1328 useless extension candidates. Maximal degree in co-relation 3397. Up to 147 conditions per place. [2021-12-06 20:06:46,582 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 21 selfloop transitions, 1 changer transitions 21/154 dead transitions. [2021-12-06 20:06:46,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 720 flow [2021-12-06 20:06:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:06:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:06:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2021-12-06 20:06:46,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843937575030012 [2021-12-06 20:06:46,585 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2021-12-06 20:06:46,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2021-12-06 20:06:46,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:06:46,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2021-12-06 20:06:46,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 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-12-06 20:06:46,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-12-06 20:06:46,589 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-12-06 20:06:46,589 INFO L186 Difference]: Start difference. First operand has 160 places, 137 transitions, 560 flow. Second operand 7 states and 703 transitions. [2021-12-06 20:06:46,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 720 flow [2021-12-06 20:06:46,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 705 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-06 20:06:46,603 INFO L242 Difference]: Finished difference. Result has 162 places, 132 transitions, 534 flow [2021-12-06 20:06:46,603 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=162, PETRI_TRANSITIONS=132} [2021-12-06 20:06:46,604 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 38 predicate places. [2021-12-06 20:06:46,604 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 534 flow [2021-12-06 20:06:46,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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-12-06 20:06:46,604 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:06:46,605 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:06:46,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:06:46,605 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 20:06:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:06:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -326935584, now seen corresponding path program 3 times [2021-12-06 20:06:46,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:06:46,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222070687] [2021-12-06 20:06:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:06:46,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:06:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 20:06:46,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 20:06:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 20:06:46,747 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 20:06:46,747 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 20:06:46,748 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 20:06:46,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 20:06:46,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 20:06:46,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 20:06:46,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 20:06:46,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 20:06:46,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:06:46,752 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:06:46,756 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 20:06:46,756 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:06:46,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:06:46 BasicIcfg [2021-12-06 20:06:46,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:06:46,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:06:46,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:06:46,857 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:06:46,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:06:41" (3/4) ... [2021-12-06 20:06:46,858 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 20:06:46,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:06:46,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:06:46,936 INFO L158 Benchmark]: Toolchain (without parser) took 7089.18ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 63.8MB in the beginning and 120.1MB in the end (delta: -56.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,936 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:06:46,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.27ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 61.2MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.04ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 58.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,937 INFO L158 Benchmark]: Boogie Preprocessor took 28.74ms. Allocated memory is still 98.6MB. Free memory was 58.2MB in the beginning and 56.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,938 INFO L158 Benchmark]: RCFGBuilder took 803.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.1MB in the beginning and 82.6MB in the end (delta: -26.5MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,938 INFO L158 Benchmark]: TraceAbstraction took 5758.10ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 82.6MB in the beginning and 151.6MB in the end (delta: -69.0MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,939 INFO L158 Benchmark]: Witness Printer took 79.04ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 120.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-12-06 20:06:46,941 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.17ms. Allocated memory is still 73.4MB. Free memory is still 30.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.27ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 61.2MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.04ms. Allocated memory is still 98.6MB. Free memory was 61.2MB in the beginning and 58.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.74ms. Allocated memory is still 98.6MB. Free memory was 58.2MB in the beginning and 56.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.1MB in the beginning and 82.6MB in the end (delta: -26.5MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5758.10ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 82.6MB in the beginning and 151.6MB in the end (delta: -69.0MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. * Witness Printer took 79.04ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 120.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=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] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=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, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] 0 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; VAL [__unbuffered_cnt=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, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; VAL [__unbuffered_cnt=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, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __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, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 833]: 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: 835]: 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, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 525 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 746 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1256 IncrementalHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 69 mSDtfsCounter, 1256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=8, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 911 NumberOfCodeBlocks, 911 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 3753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-12-06 20:06:46,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66c8932-ec6c-4d32-aeca-bab7ccb0f64d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE