./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro --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 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:15:38,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:15:38,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:15:38,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:15:38,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:15:38,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:15:38,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:15:38,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:15:38,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:15:38,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:15:38,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:15:38,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:15:38,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:15:38,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:15:38,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:15:38,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:15:38,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:15:38,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:15:38,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:15:38,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:15:38,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:15:38,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:15:38,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:15:38,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:15:38,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:15:38,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:15:38,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:15:38,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:15:38,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:15:38,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:15:38,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:15:38,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:15:38,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:15:38,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:15:38,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:15:38,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:15:38,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:15:38,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:15:38,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:15:38,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:15:38,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:15:38,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:15:38,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:15:38,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:15:38,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:15:38,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:15:38,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:15:38,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:15:38,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:15:38,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:15:38,197 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:15:38,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:15:38,199 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:15:38,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:15:38,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:15:38,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:15:38,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:15:38,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:15:38,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:15:38,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:15:38,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:15:38,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:15:38,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:15:38,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:15:38,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:15:38,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:15:38,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:15:38,204 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:15:38,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:15:38,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:15:38,205 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_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/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_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro 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 -> 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 [2022-11-18 20:15:38,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:15:38,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:15:38,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:15:38,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:15:38,531 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:15:38,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2022-11-18 20:15:38,598 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/data/3fc41a856/56c7810fe7064f4cb8e6d5fe365d9fe4/FLAGa267c906c [2022-11-18 20:15:39,200 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:15:39,201 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2022-11-18 20:15:39,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/data/3fc41a856/56c7810fe7064f4cb8e6d5fe365d9fe4/FLAGa267c906c [2022-11-18 20:15:39,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/data/3fc41a856/56c7810fe7064f4cb8e6d5fe365d9fe4 [2022-11-18 20:15:39,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:15:39,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:15:39,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:15:39,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:15:39,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:15:39,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:15:39" (1/1) ... [2022-11-18 20:15:39,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100c0dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:39, skipping insertion in model container [2022-11-18 20:15:39,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:15:39" (1/1) ... [2022-11-18 20:15:39,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:15:39,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:15:39,801 WARN L234 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_b4668120-90f9-4d24-bd91-be0bf6669233/sv-benchmarks/c/pthread-wmm/mix003.oepc.i[945,958] [2022-11-18 20:15:40,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:15:40,119 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:15:40,132 WARN L234 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_b4668120-90f9-4d24-bd91-be0bf6669233/sv-benchmarks/c/pthread-wmm/mix003.oepc.i[945,958] [2022-11-18 20:15:40,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:15:40,202 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:15:40,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40 WrapperNode [2022-11-18 20:15:40,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:15:40,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:15:40,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:15:40,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:15:40,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,252 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-18 20:15:40,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:15:40,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:15:40,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:15:40,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:15:40,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,282 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:15:40,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:15:40,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:15:40,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:15:40,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (1/1) ... [2022-11-18 20:15:40,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:15:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:40,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:15:40,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:15:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:15:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:15:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:15:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:15:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:15:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:15:40,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:15:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:15:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:15:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:15:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:15:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:15:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:15:40,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:15:40,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:15:40,392 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:15:40,592 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:15:40,594 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:15:40,982 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:15:41,297 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:15:41,297 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:15:41,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:15:41 BoogieIcfgContainer [2022-11-18 20:15:41,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:15:41,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:15:41,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:15:41,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:15:41,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:15:39" (1/3) ... [2022-11-18 20:15:41,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78990f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:15:41, skipping insertion in model container [2022-11-18 20:15:41,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:15:40" (2/3) ... [2022-11-18 20:15:41,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78990f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:15:41, skipping insertion in model container [2022-11-18 20:15:41,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:15:41" (3/3) ... [2022-11-18 20:15:41,309 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2022-11-18 20:15:41,318 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:15:41,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:15:41,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:15:41,344 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:15:41,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:15:41,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-11-18 20:15:41,493 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-18 20:15:41,494 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:15:41,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-18 20:15:41,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-11-18 20:15:41,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-11-18 20:15:41,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:15:41,521 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a1e240b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:15:41,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:15:41,533 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2022-11-18 20:15:41,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:15:41,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:41,534 INFO L209 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] [2022-11-18 20:15:41,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1827855813, now seen corresponding path program 1 times [2022-11-18 20:15:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9049240] [2022-11-18 20:15:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9049240] [2022-11-18 20:15:42,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9049240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:42,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:42,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:15:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758880394] [2022-11-18 20:15:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:42,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:15:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:15:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:15:42,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 120 [2022-11-18 20:15:42,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2022-11-18 20:15:42,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:42,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 120 [2022-11-18 20:15:42,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:42,444 INFO L130 PetriNetUnfolder]: 58/327 cut-off events. [2022-11-18 20:15:42,444 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 20:15:42,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1376 event pairs, 44 based on Foata normal form. 18/323 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2022-11-18 20:15:42,451 INFO L137 encePairwiseOnDemand]: 115/120 looper letters, 14 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2022-11-18 20:15:42,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 285 flow [2022-11-18 20:15:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:15:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:15:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-11-18 20:15:42,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-11-18 20:15:42,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-11-18 20:15:42,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-11-18 20:15:42,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:42,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-11-18 20:15:42,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2022-11-18 20:15:42,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2022-11-18 20:15:42,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2022-11-18 20:15:42,510 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-11-18 20:15:42,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 285 flow [2022-11-18 20:15:42,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:15:42,529 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-11-18 20:15:42,534 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-11-18 20:15:42,537 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-11-18 20:15:42,539 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-11-18 20:15:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2022-11-18 20:15:42,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:42,540 INFO L209 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] [2022-11-18 20:15:42,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:15:42,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1941794522, now seen corresponding path program 1 times [2022-11-18 20:15:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:42,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237914921] [2022-11-18 20:15:42,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237914921] [2022-11-18 20:15:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237914921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:43,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:43,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:15:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750886524] [2022-11-18 20:15:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:43,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:15:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:15:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:15:43,138 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-11-18 20:15:43,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2022-11-18 20:15:43,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:43,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-11-18 20:15:43,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:44,332 INFO L130 PetriNetUnfolder]: 1548/3915 cut-off events. [2022-11-18 20:15:44,333 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-11-18 20:15:44,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6460 conditions, 3915 events. 1548/3915 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 31749 event pairs, 231 based on Foata normal form. 0/3815 useless extension candidates. Maximal degree in co-relation 6401. Up to 1236 conditions per place. [2022-11-18 20:15:44,358 INFO L137 encePairwiseOnDemand]: 114/120 looper letters, 30 selfloop transitions, 2 changer transitions 66/175 dead transitions. [2022-11-18 20:15:44,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 175 transitions, 550 flow [2022-11-18 20:15:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:15:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:15:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2022-11-18 20:15:44,362 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-11-18 20:15:44,362 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2022-11-18 20:15:44,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2022-11-18 20:15:44,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:44,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2022-11-18 20:15:44,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 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) [2022-11-18 20:15:44,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 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) [2022-11-18 20:15:44,374 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 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) [2022-11-18 20:15:44,374 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 9 states and 908 transitions. [2022-11-18 20:15:44,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 175 transitions, 550 flow [2022-11-18 20:15:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:15:44,383 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 228 flow [2022-11-18 20:15:44,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2022-11-18 20:15:44,384 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-11-18 20:15:44,385 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 228 flow [2022-11-18 20:15:44,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2022-11-18 20:15:44,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:44,386 INFO L209 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] [2022-11-18 20:15:44,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:15:44,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 488923800, now seen corresponding path program 1 times [2022-11-18 20:15:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:44,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972486938] [2022-11-18 20:15:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972486938] [2022-11-18 20:15:44,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972486938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:44,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:44,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:15:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619574054] [2022-11-18 20:15:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:44,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:15:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:15:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:15:44,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-11-18 20:15:44,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-11-18 20:15:44,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:44,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-11-18 20:15:44,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:45,537 INFO L130 PetriNetUnfolder]: 1007/1866 cut-off events. [2022-11-18 20:15:45,537 INFO L131 PetriNetUnfolder]: For 503/503 co-relation queries the response was YES. [2022-11-18 20:15:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3980 conditions, 1866 events. 1007/1866 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10268 event pairs, 180 based on Foata normal form. 48/1861 useless extension candidates. Maximal degree in co-relation 3914. Up to 846 conditions per place. [2022-11-18 20:15:45,551 INFO L137 encePairwiseOnDemand]: 113/120 looper letters, 28 selfloop transitions, 3 changer transitions 46/154 dead transitions. [2022-11-18 20:15:45,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 154 transitions, 509 flow [2022-11-18 20:15:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:15:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:15:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-11-18 20:15:45,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8241666666666667 [2022-11-18 20:15:45,556 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 989 transitions. [2022-11-18 20:15:45,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 989 transitions. [2022-11-18 20:15:45,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:45,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 989 transitions. [2022-11-18 20:15:45,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 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) [2022-11-18 20:15:45,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:45,566 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:45,566 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 228 flow. Second operand 10 states and 989 transitions. [2022-11-18 20:15:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 154 transitions, 509 flow [2022-11-18 20:15:45,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 154 transitions, 475 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-18 20:15:45,582 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 234 flow [2022-11-18 20:15:45,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-11-18 20:15:45,583 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-11-18 20:15:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 234 flow [2022-11-18 20:15:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-11-18 20:15:45,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:45,585 INFO L209 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] [2022-11-18 20:15:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:15:45,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -741925712, now seen corresponding path program 1 times [2022-11-18 20:15:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876382051] [2022-11-18 20:15:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:45,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876382051] [2022-11-18 20:15:45,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876382051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:45,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:45,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:15:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792961298] [2022-11-18 20:15:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:15:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:45,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:15:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:15:45,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-11-18 20:15:45,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 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) [2022-11-18 20:15:45,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:45,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-11-18 20:15:45,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:46,508 INFO L130 PetriNetUnfolder]: 917/1963 cut-off events. [2022-11-18 20:15:46,508 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-11-18 20:15:46,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 1963 events. 917/1963 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13389 event pairs, 60 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3622. Up to 481 conditions per place. [2022-11-18 20:15:46,519 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 6 changer transitions 50/168 dead transitions. [2022-11-18 20:15:46,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 546 flow [2022-11-18 20:15:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:15:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:15:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2022-11-18 20:15:46,524 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2022-11-18 20:15:46,524 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2022-11-18 20:15:46,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2022-11-18 20:15:46,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:46,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2022-11-18 20:15:46,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 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) [2022-11-18 20:15:46,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,535 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,535 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 234 flow. Second operand 10 states and 1049 transitions. [2022-11-18 20:15:46,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 546 flow [2022-11-18 20:15:46,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 528 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-11-18 20:15:46,543 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2022-11-18 20:15:46,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-11-18 20:15:46,545 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-11-18 20:15:46,547 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2022-11-18 20:15:46,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 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) [2022-11-18 20:15:46,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:46,548 INFO L209 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] [2022-11-18 20:15:46,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:15:46,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash -330821029, now seen corresponding path program 1 times [2022-11-18 20:15:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:46,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482637060] [2022-11-18 20:15:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482637060] [2022-11-18 20:15:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482637060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:46,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:46,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:15:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353461857] [2022-11-18 20:15:46,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:46,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:15:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:15:46,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:15:46,898 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-11-18 20:15:46,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 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) [2022-11-18 20:15:46,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:46,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-11-18 20:15:46,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:47,853 INFO L130 PetriNetUnfolder]: 1014/2653 cut-off events. [2022-11-18 20:15:47,853 INFO L131 PetriNetUnfolder]: For 1061/1153 co-relation queries the response was YES. [2022-11-18 20:15:47,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2653 events. 1014/2653 cut-off events. For 1061/1153 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20450 event pairs, 200 based on Foata normal form. 52/2607 useless extension candidates. Maximal degree in co-relation 5673. Up to 728 conditions per place. [2022-11-18 20:15:47,875 INFO L137 encePairwiseOnDemand]: 109/120 looper letters, 70 selfloop transitions, 18 changer transitions 0/165 dead transitions. [2022-11-18 20:15:47,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 576 flow [2022-11-18 20:15:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:15:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:15:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1069 transitions. [2022-11-18 20:15:47,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8098484848484848 [2022-11-18 20:15:47,879 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1069 transitions. [2022-11-18 20:15:47,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1069 transitions. [2022-11-18 20:15:47,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:47,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1069 transitions. [2022-11-18 20:15:47,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 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) [2022-11-18 20:15:47,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 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) [2022-11-18 20:15:47,887 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 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) [2022-11-18 20:15:47,887 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 11 states and 1069 transitions. [2022-11-18 20:15:47,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 576 flow [2022-11-18 20:15:47,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 165 transitions, 562 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-18 20:15:47,896 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 392 flow [2022-11-18 20:15:47,896 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2022-11-18 20:15:47,897 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 7 predicate places. [2022-11-18 20:15:47,897 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 392 flow [2022-11-18 20:15:47,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 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) [2022-11-18 20:15:47,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:47,898 INFO L209 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] [2022-11-18 20:15:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:15:47,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1364905527, now seen corresponding path program 2 times [2022-11-18 20:15:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895954726] [2022-11-18 20:15:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:48,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895954726] [2022-11-18 20:15:48,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895954726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:48,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:48,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:15:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621179861] [2022-11-18 20:15:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:15:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:15:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:15:48,158 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-11-18 20:15:48,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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) [2022-11-18 20:15:48,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:48,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-11-18 20:15:48,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:48,835 INFO L130 PetriNetUnfolder]: 808/2028 cut-off events. [2022-11-18 20:15:48,835 INFO L131 PetriNetUnfolder]: For 2498/2640 co-relation queries the response was YES. [2022-11-18 20:15:48,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5454 conditions, 2028 events. 808/2028 cut-off events. For 2498/2640 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14725 event pairs, 73 based on Foata normal form. 81/2049 useless extension candidates. Maximal degree in co-relation 5384. Up to 455 conditions per place. [2022-11-18 20:15:48,852 INFO L137 encePairwiseOnDemand]: 111/120 looper letters, 54 selfloop transitions, 19 changer transitions 28/188 dead transitions. [2022-11-18 20:15:48,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 931 flow [2022-11-18 20:15:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:15:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:15:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2022-11-18 20:15:48,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8725 [2022-11-18 20:15:48,856 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2022-11-18 20:15:48,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2022-11-18 20:15:48,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:48,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2022-11-18 20:15:48,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 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) [2022-11-18 20:15:48,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,863 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,863 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 392 flow. Second operand 10 states and 1047 transitions. [2022-11-18 20:15:48,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 931 flow [2022-11-18 20:15:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 188 transitions, 924 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-18 20:15:48,874 INFO L231 Difference]: Finished difference. Result has 142 places, 127 transitions, 525 flow [2022-11-18 20:15:48,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2022-11-18 20:15:48,875 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places. [2022-11-18 20:15:48,875 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 525 flow [2022-11-18 20:15:48,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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) [2022-11-18 20:15:48,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:48,876 INFO L209 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] [2022-11-18 20:15:48,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:15:48,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash -300180182, now seen corresponding path program 1 times [2022-11-18 20:15:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:48,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706909945] [2022-11-18 20:15:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:49,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706909945] [2022-11-18 20:15:49,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706909945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:49,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:49,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:15:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324321033] [2022-11-18 20:15:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:15:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:15:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:15:49,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-11-18 20:15:49,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 525 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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) [2022-11-18 20:15:49,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:49,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-11-18 20:15:49,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:49,923 INFO L130 PetriNetUnfolder]: 732/1774 cut-off events. [2022-11-18 20:15:49,923 INFO L131 PetriNetUnfolder]: For 3472/3635 co-relation queries the response was YES. [2022-11-18 20:15:49,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5414 conditions, 1774 events. 732/1774 cut-off events. For 3472/3635 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12837 event pairs, 68 based on Foata normal form. 36/1753 useless extension candidates. Maximal degree in co-relation 5391. Up to 420 conditions per place. [2022-11-18 20:15:49,938 INFO L137 encePairwiseOnDemand]: 111/120 looper letters, 43 selfloop transitions, 24 changer transitions 31/182 dead transitions. [2022-11-18 20:15:49,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 182 transitions, 981 flow [2022-11-18 20:15:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:15:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:15:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions. [2022-11-18 20:15:49,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8532051282051282 [2022-11-18 20:15:49,944 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions. [2022-11-18 20:15:49,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions. [2022-11-18 20:15:49,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:49,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions. [2022-11-18 20:15:49,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 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) [2022-11-18 20:15:49,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-11-18 20:15:49,954 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-11-18 20:15:49,954 INFO L175 Difference]: Start difference. First operand has 142 places, 127 transitions, 525 flow. Second operand 13 states and 1331 transitions. [2022-11-18 20:15:49,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 182 transitions, 981 flow [2022-11-18 20:15:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 182 transitions, 822 flow, removed 72 selfloop flow, removed 9 redundant places. [2022-11-18 20:15:49,987 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 466 flow [2022-11-18 20:15:49,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=466, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2022-11-18 20:15:49,988 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 23 predicate places. [2022-11-18 20:15:49,989 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 466 flow [2022-11-18 20:15:49,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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) [2022-11-18 20:15:49,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:49,990 INFO L209 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, 1] [2022-11-18 20:15:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:15:49,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -602561487, now seen corresponding path program 1 times [2022-11-18 20:15:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:49,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205600106] [2022-11-18 20:15:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205600106] [2022-11-18 20:15:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205600106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:15:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986210341] [2022-11-18 20:15:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:51,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:15:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:15:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:15:51,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2022-11-18 20:15:51,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 466 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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) [2022-11-18 20:15:51,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:51,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2022-11-18 20:15:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:51,689 INFO L130 PetriNetUnfolder]: 285/1480 cut-off events. [2022-11-18 20:15:51,689 INFO L131 PetriNetUnfolder]: For 1992/2039 co-relation queries the response was YES. [2022-11-18 20:15:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3543 conditions, 1480 events. 285/1480 cut-off events. For 1992/2039 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13860 event pairs, 11 based on Foata normal form. 1/1435 useless extension candidates. Maximal degree in co-relation 3464. Up to 162 conditions per place. [2022-11-18 20:15:51,702 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 29 selfloop transitions, 6 changer transitions 11/147 dead transitions. [2022-11-18 20:15:51,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 147 transitions, 642 flow [2022-11-18 20:15:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:15:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:15:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-11-18 20:15:51,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8116666666666666 [2022-11-18 20:15:51,706 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-11-18 20:15:51,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-11-18 20:15:51,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:51,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-11-18 20:15:51,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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) [2022-11-18 20:15:51,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:51,712 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:51,713 INFO L175 Difference]: Start difference. First operand has 148 places, 124 transitions, 466 flow. Second operand 10 states and 974 transitions. [2022-11-18 20:15:51,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 147 transitions, 642 flow [2022-11-18 20:15:51,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 147 transitions, 594 flow, removed 10 selfloop flow, removed 10 redundant places. [2022-11-18 20:15:51,739 INFO L231 Difference]: Finished difference. Result has 149 places, 128 transitions, 468 flow [2022-11-18 20:15:51,740 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=468, PETRI_PLACES=149, PETRI_TRANSITIONS=128} [2022-11-18 20:15:51,740 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 24 predicate places. [2022-11-18 20:15:51,741 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 128 transitions, 468 flow [2022-11-18 20:15:51,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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) [2022-11-18 20:15:51,741 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:51,742 INFO L209 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, 1] [2022-11-18 20:15:51,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:15:51,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:51,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 447225805, now seen corresponding path program 2 times [2022-11-18 20:15:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:51,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162384416] [2022-11-18 20:15:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162384416] [2022-11-18 20:15:52,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162384416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:52,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:52,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:15:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318408841] [2022-11-18 20:15:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:15:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:15:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:15:52,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-11-18 20:15:52,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 128 transitions, 468 flow. Second operand has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 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) [2022-11-18 20:15:52,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:52,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-11-18 20:15:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:53,267 INFO L130 PetriNetUnfolder]: 242/1229 cut-off events. [2022-11-18 20:15:53,267 INFO L131 PetriNetUnfolder]: For 1250/1292 co-relation queries the response was YES. [2022-11-18 20:15:53,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2951 conditions, 1229 events. 242/1229 cut-off events. For 1250/1292 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11046 event pairs, 8 based on Foata normal form. 14/1204 useless extension candidates. Maximal degree in co-relation 2925. Up to 132 conditions per place. [2022-11-18 20:15:53,278 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 28 selfloop transitions, 7 changer transitions 10/144 dead transitions. [2022-11-18 20:15:53,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 144 transitions, 642 flow [2022-11-18 20:15:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:15:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:15:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1042 transitions. [2022-11-18 20:15:53,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7893939393939394 [2022-11-18 20:15:53,281 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1042 transitions. [2022-11-18 20:15:53,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1042 transitions. [2022-11-18 20:15:53,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:53,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1042 transitions. [2022-11-18 20:15:53,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.72727272727273) internal successors, (1042), 11 states have internal predecessors, (1042), 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) [2022-11-18 20:15:53,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 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) [2022-11-18 20:15:53,289 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 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) [2022-11-18 20:15:53,289 INFO L175 Difference]: Start difference. First operand has 149 places, 128 transitions, 468 flow. Second operand 11 states and 1042 transitions. [2022-11-18 20:15:53,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 144 transitions, 642 flow [2022-11-18 20:15:53,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 599 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-11-18 20:15:53,308 INFO L231 Difference]: Finished difference. Result has 150 places, 128 transitions, 475 flow [2022-11-18 20:15:53,308 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=150, PETRI_TRANSITIONS=128} [2022-11-18 20:15:53,309 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 25 predicate places. [2022-11-18 20:15:53,309 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 128 transitions, 475 flow [2022-11-18 20:15:53,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 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) [2022-11-18 20:15:53,310 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:53,310 INFO L209 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, 1] [2022-11-18 20:15:53,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:15:53,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2110746605, now seen corresponding path program 3 times [2022-11-18 20:15:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:53,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733846089] [2022-11-18 20:15:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:53,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733846089] [2022-11-18 20:15:53,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733846089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:53,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:53,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:15:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082359584] [2022-11-18 20:15:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:15:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:15:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:15:53,684 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-11-18 20:15:53,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 128 transitions, 475 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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) [2022-11-18 20:15:53,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:53,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-11-18 20:15:53,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:54,216 INFO L130 PetriNetUnfolder]: 487/2159 cut-off events. [2022-11-18 20:15:54,216 INFO L131 PetriNetUnfolder]: For 2266/2312 co-relation queries the response was YES. [2022-11-18 20:15:54,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 2159 events. 487/2159 cut-off events. For 2266/2312 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21403 event pairs, 60 based on Foata normal form. 1/2087 useless extension candidates. Maximal degree in co-relation 5242. Up to 302 conditions per place. [2022-11-18 20:15:54,233 INFO L137 encePairwiseOnDemand]: 108/120 looper letters, 35 selfloop transitions, 10 changer transitions 13/152 dead transitions. [2022-11-18 20:15:54,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 152 transitions, 716 flow [2022-11-18 20:15:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:15:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:15:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2022-11-18 20:15:54,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.790625 [2022-11-18 20:15:54,236 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2022-11-18 20:15:54,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2022-11-18 20:15:54,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:54,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2022-11-18 20:15:54,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 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) [2022-11-18 20:15:54,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 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) [2022-11-18 20:15:54,242 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 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) [2022-11-18 20:15:54,242 INFO L175 Difference]: Start difference. First operand has 150 places, 128 transitions, 475 flow. Second operand 8 states and 759 transitions. [2022-11-18 20:15:54,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 152 transitions, 716 flow [2022-11-18 20:15:54,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 152 transitions, 668 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-11-18 20:15:54,282 INFO L231 Difference]: Finished difference. Result has 148 places, 134 transitions, 530 flow [2022-11-18 20:15:54,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=148, PETRI_TRANSITIONS=134} [2022-11-18 20:15:54,283 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 23 predicate places. [2022-11-18 20:15:54,283 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 134 transitions, 530 flow [2022-11-18 20:15:54,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 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) [2022-11-18 20:15:54,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:54,284 INFO L209 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, 1] [2022-11-18 20:15:54,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:15:54,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:15:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1636512621, now seen corresponding path program 4 times [2022-11-18 20:15:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:54,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834191823] [2022-11-18 20:15:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:15:54,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:15:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:15:54,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:15:54,429 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:15:54,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:15:54,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:15:54,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:15:54,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:15:54,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:15:54,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:15:54,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:15:54,434 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-11-18 20:15:54,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:15:54,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:15:54,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:15:54 BasicIcfg [2022-11-18 20:15:54,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:15:54,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:15:54,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:15:54,575 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:15:54,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:15:41" (3/4) ... [2022-11-18 20:15:54,578 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:15:54,690 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:15:54,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:15:54,691 INFO L158 Benchmark]: Toolchain (without parser) took 15189.19ms. Allocated memory was 132.1MB in the beginning and 398.5MB in the end (delta: 266.3MB). Free memory was 100.6MB in the beginning and 141.0MB in the end (delta: -40.4MB). Peak memory consumption was 225.7MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,691 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:15:54,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.22ms. Allocated memory is still 132.1MB. Free memory was 100.2MB in the beginning and 94.6MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.53ms. Allocated memory is still 132.1MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,693 INFO L158 Benchmark]: Boogie Preprocessor took 33.88ms. Allocated memory is still 132.1MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,693 INFO L158 Benchmark]: RCFGBuilder took 1012.37ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 55.8MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,693 INFO L158 Benchmark]: TraceAbstraction took 13271.98ms. Allocated memory was 132.1MB in the beginning and 398.5MB in the end (delta: 266.3MB). Free memory was 54.9MB in the beginning and 166.1MB in the end (delta: -111.2MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,694 INFO L158 Benchmark]: Witness Printer took 115.67ms. Allocated memory is still 398.5MB. Free memory was 166.1MB in the beginning and 141.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-18 20:15:54,696 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.22ms. Allocated memory is still 92.3MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.22ms. Allocated memory is still 132.1MB. Free memory was 100.2MB in the beginning and 94.6MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.53ms. Allocated memory is still 132.1MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.88ms. Allocated memory is still 132.1MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.37ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 55.8MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13271.98ms. Allocated memory was 132.1MB in the beginning and 398.5MB in the end (delta: 266.3MB). Free memory was 54.9MB in the beginning and 166.1MB in the end (delta: -111.2MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. * Witness Printer took 115.67ms. Allocated memory is still 398.5MB. Free memory was 166.1MB in the beginning and 141.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L740] 0 int z$w_buff0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 846]: 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: 848]: 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: 850]: 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, 149 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: 13.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 597 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 461 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 128 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=10, InterpolantAutomatonStates: 95, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 3930 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! [2022-11-18 20:15:54,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4668120-90f9-4d24-bd91-be0bf6669233/bin/uautomizer-TMbwUNV5ro/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