./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011.opt.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_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/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_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/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_75942f99-aa6f-48dc-8bc1-20c89183dab7/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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- 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 19:48:08,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:48:08,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:48:08,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:48:08,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:48:08,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:48:08,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:48:08,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:48:08,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:48:08,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:48:08,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:48:08,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:48:08,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:48:08,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:48:08,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:48:08,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:48:08,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:48:08,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:48:08,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:48:08,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:48:08,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:48:08,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:48:08,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:48:08,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:48:08,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:48:08,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:48:08,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:48:08,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:48:08,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:48:08,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:48:08,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:48:08,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:48:08,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:48:08,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:48:08,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:48:08,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:48:08,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:48:08,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:48:08,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:48:08,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:48:08,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:48:08,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:48:08,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:48:08,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:48:08,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:48:08,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:48:08,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:48:08,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:48:08,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:48:08,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:48:08,489 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:48:08,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:48:08,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:48:08,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:48:08,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:48:08,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:48:08,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:48:08,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:48:08,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:48:08,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:48:08,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:48:08,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:48:08,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:48:08,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:48:08,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:48:08,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:48:08,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:48:08,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:48:08,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:48:08,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:48:08,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:48:08,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:48:08,496 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:48:08,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:48:08,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:48:08,497 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_75942f99-aa6f-48dc-8bc1-20c89183dab7/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_75942f99-aa6f-48dc-8bc1-20c89183dab7/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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2022-11-18 19:48:08,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:48:08,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:48:08,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:48:08,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:48:08,970 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:48:08,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-11-18 19:48:09,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/data/bfa6e532d/7721e497d5764552af6068de58de9c4e/FLAG27f187c22 [2022-11-18 19:48:09,802 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:48:09,816 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2022-11-18 19:48:09,840 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/data/bfa6e532d/7721e497d5764552af6068de58de9c4e/FLAG27f187c22 [2022-11-18 19:48:10,050 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/data/bfa6e532d/7721e497d5764552af6068de58de9c4e [2022-11-18 19:48:10,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:48:10,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:48:10,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:48:10,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:48:10,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:48:10,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:10,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b79cb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10, skipping insertion in model container [2022-11-18 19:48:10,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:10,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:48:10,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:48:10,429 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_75942f99-aa6f-48dc-8bc1-20c89183dab7/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-11-18 19:48:10,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:48:10,812 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:48:10,831 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_75942f99-aa6f-48dc-8bc1-20c89183dab7/sv-benchmarks/c/pthread-wmm/mix011.opt.i[944,957] [2022-11-18 19:48:10,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:48:10,988 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:48:10,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10 WrapperNode [2022-11-18 19:48:10,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:48:10,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:48:10,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:48:10,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:48:11,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,092 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-11-18 19:48:11,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:48:11,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:48:11,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:48:11,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:48:11,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:48:11,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:48:11,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:48:11,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:48:11,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (1/1) ... [2022-11-18 19:48:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:48:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:48:11,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:48:11,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:48:11,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:48:11,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:48:11,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:48:11,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:48:11,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:48:11,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:48:11,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:48:11,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:48:11,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:48:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 19:48:11,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 19:48:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:48:11,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:48:11,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:48:11,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:48:11,284 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 19:48:11,463 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:48:11,466 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:48:12,064 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:48:12,324 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:48:12,324 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:48:12,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:48:12 BoogieIcfgContainer [2022-11-18 19:48:12,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:48:12,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:48:12,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:48:12,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:48:12,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:48:10" (1/3) ... [2022-11-18 19:48:12,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7c077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:48:12, skipping insertion in model container [2022-11-18 19:48:12,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:48:10" (2/3) ... [2022-11-18 19:48:12,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7c077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:48:12, skipping insertion in model container [2022-11-18 19:48:12,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:48:12" (3/3) ... [2022-11-18 19:48:12,348 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2022-11-18 19:48:12,358 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:48:12,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:48:12,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:48:12,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:48:12,475 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:48:12,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-18 19:48:12,638 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-18 19:48:12,638 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:48:12,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-18 19:48:12,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-18 19:48:12,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-18 19:48:12,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:48:12,692 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;@192b8852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:48:12,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 19:48:12,733 INFO L130 PetriNetUnfolder]: 0/76 cut-off events. [2022-11-18 19:48:12,735 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:48:12,736 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:12,737 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] [2022-11-18 19:48:12,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash 12575575, now seen corresponding path program 1 times [2022-11-18 19:48:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:12,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719318928] [2022-11-18 19:48:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:13,565 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 19:48:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:13,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719318928] [2022-11-18 19:48:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719318928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:13,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:48:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086081046] [2022-11-18 19:48:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:13,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:48:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:48:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:48:13,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 119 [2022-11-18 19:48:13,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 19:48:13,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:13,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 119 [2022-11-18 19:48:13,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:13,781 INFO L130 PetriNetUnfolder]: 14/193 cut-off events. [2022-11-18 19:48:13,781 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 19:48:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 193 events. 14/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs, 6 based on Foata normal form. 6/189 useless extension candidates. Maximal degree in co-relation 185. Up to 25 conditions per place. [2022-11-18 19:48:13,786 INFO L137 encePairwiseOnDemand]: 114/119 looper letters, 9 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-11-18 19:48:13,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 259 flow [2022-11-18 19:48:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:48:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:48:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-11-18 19:48:13,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9355742296918768 [2022-11-18 19:48:13,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-11-18 19:48:13,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-11-18 19:48:13,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:13,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-11-18 19:48:13,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 19:48:13,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:13,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:13,824 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 334 transitions. [2022-11-18 19:48:13,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 259 flow [2022-11-18 19:48:13,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 114 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:48:13,833 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-11-18 19:48:13,836 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-11-18 19:48:13,840 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-11-18 19:48:13,840 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-11-18 19:48:13,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 19:48:13,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:13,842 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 19:48:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:48:13,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash 706716690, now seen corresponding path program 1 times [2022-11-18 19:48:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574780427] [2022-11-18 19:48:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:14,395 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 19:48:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:14,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574780427] [2022-11-18 19:48:14,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574780427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:14,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:14,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:48:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811742381] [2022-11-18 19:48:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:14,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:48:14,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:48:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:48:14,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-18 19:48:14,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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 19:48:14,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:14,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-18 19:48:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:15,810 INFO L130 PetriNetUnfolder]: 1259/3680 cut-off events. [2022-11-18 19:48:15,810 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-11-18 19:48:15,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5851 conditions, 3680 events. 1259/3680 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 32683 event pairs, 340 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 5792. Up to 873 conditions per place. [2022-11-18 19:48:15,879 INFO L137 encePairwiseOnDemand]: 106/119 looper letters, 28 selfloop transitions, 9 changer transitions 70/184 dead transitions. [2022-11-18 19:48:15,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 184 transitions, 586 flow [2022-11-18 19:48:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:48:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:48:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2022-11-18 19:48:15,886 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2022-11-18 19:48:15,886 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2022-11-18 19:48:15,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2022-11-18 19:48:15,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:15,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2022-11-18 19:48:15,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.88888888888889) internal successors, (917), 9 states have internal predecessors, (917), 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 19:48:15,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:15,897 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:15,897 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 917 transitions. [2022-11-18 19:48:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 184 transitions, 586 flow [2022-11-18 19:48:15,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 184 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:48:15,902 INFO L231 Difference]: Finished difference. Result has 135 places, 106 transitions, 316 flow [2022-11-18 19:48:15,903 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=135, PETRI_TRANSITIONS=106} [2022-11-18 19:48:15,904 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2022-11-18 19:48:15,904 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 106 transitions, 316 flow [2022-11-18 19:48:15,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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 19:48:15,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:15,905 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] [2022-11-18 19:48:15,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:48:15,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1554999359, now seen corresponding path program 1 times [2022-11-18 19:48:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940915737] [2022-11-18 19:48:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:16,234 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 19:48:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:16,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940915737] [2022-11-18 19:48:16,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940915737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:16,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:16,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:16,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191868522] [2022-11-18 19:48:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:16,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:16,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-18 19:48:16,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 106 transitions, 316 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 19:48:16,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:16,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-18 19:48:16,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:17,239 INFO L130 PetriNetUnfolder]: 768/1969 cut-off events. [2022-11-18 19:48:17,239 INFO L131 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-11-18 19:48:17,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5788 conditions, 1969 events. 768/1969 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14465 event pairs, 132 based on Foata normal form. 45/1968 useless extension candidates. Maximal degree in co-relation 5717. Up to 565 conditions per place. [2022-11-18 19:48:17,256 INFO L137 encePairwiseOnDemand]: 107/119 looper letters, 33 selfloop transitions, 9 changer transitions 61/180 dead transitions. [2022-11-18 19:48:17,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 180 transitions, 980 flow [2022-11-18 19:48:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:48:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:48:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1276 transitions. [2022-11-18 19:48:17,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248222365869424 [2022-11-18 19:48:17,261 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1276 transitions. [2022-11-18 19:48:17,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1276 transitions. [2022-11-18 19:48:17,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:17,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1276 transitions. [2022-11-18 19:48:17,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 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 19:48:17,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:17,271 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:17,272 INFO L175 Difference]: Start difference. First operand has 135 places, 106 transitions, 316 flow. Second operand 13 states and 1276 transitions. [2022-11-18 19:48:17,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 180 transitions, 980 flow [2022-11-18 19:48:17,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 180 transitions, 882 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-18 19:48:17,287 INFO L231 Difference]: Finished difference. Result has 139 places, 110 transitions, 390 flow [2022-11-18 19:48:17,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=390, PETRI_PLACES=139, PETRI_TRANSITIONS=110} [2022-11-18 19:48:17,288 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 15 predicate places. [2022-11-18 19:48:17,288 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 110 transitions, 390 flow [2022-11-18 19:48:17,289 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 19:48:17,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:17,289 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 19:48:17,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:48:17,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash 412253757, now seen corresponding path program 1 times [2022-11-18 19:48:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:17,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598242860] [2022-11-18 19:48:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:17,619 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 19:48:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598242860] [2022-11-18 19:48:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598242860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436449723] [2022-11-18 19:48:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:17,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-18 19:48:17,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 110 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:17,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:17,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-18 19:48:17,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:18,388 INFO L130 PetriNetUnfolder]: 627/1540 cut-off events. [2022-11-18 19:48:18,388 INFO L131 PetriNetUnfolder]: For 4585/4585 co-relation queries the response was YES. [2022-11-18 19:48:18,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5439 conditions, 1540 events. 627/1540 cut-off events. For 4585/4585 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10018 event pairs, 199 based on Foata normal form. 35/1519 useless extension candidates. Maximal degree in co-relation 5356. Up to 499 conditions per place. [2022-11-18 19:48:18,404 INFO L137 encePairwiseOnDemand]: 106/119 looper letters, 34 selfloop transitions, 17 changer transitions 55/183 dead transitions. [2022-11-18 19:48:18,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 1114 flow [2022-11-18 19:48:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:48:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:48:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1286 transitions. [2022-11-18 19:48:18,408 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8312863606981254 [2022-11-18 19:48:18,408 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1286 transitions. [2022-11-18 19:48:18,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1286 transitions. [2022-11-18 19:48:18,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:18,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1286 transitions. [2022-11-18 19:48:18,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 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 19:48:18,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:18,415 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:18,416 INFO L175 Difference]: Start difference. First operand has 139 places, 110 transitions, 390 flow. Second operand 13 states and 1286 transitions. [2022-11-18 19:48:18,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 1114 flow [2022-11-18 19:48:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 183 transitions, 1032 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-11-18 19:48:18,440 INFO L231 Difference]: Finished difference. Result has 146 places, 114 transitions, 477 flow [2022-11-18 19:48:18,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=477, PETRI_PLACES=146, PETRI_TRANSITIONS=114} [2022-11-18 19:48:18,441 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 22 predicate places. [2022-11-18 19:48:18,442 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 114 transitions, 477 flow [2022-11-18 19:48:18,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:18,442 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:18,442 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] [2022-11-18 19:48:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:48:18,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1439464732, now seen corresponding path program 1 times [2022-11-18 19:48:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:18,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819666184] [2022-11-18 19:48:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:18,837 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 19:48:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819666184] [2022-11-18 19:48:18,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819666184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:18,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:18,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027133186] [2022-11-18 19:48:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:18,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:18,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-18 19:48:18,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 114 transitions, 477 flow. Second operand has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 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 19:48:18,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:18,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-18 19:48:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:19,558 INFO L130 PetriNetUnfolder]: 482/1297 cut-off events. [2022-11-18 19:48:19,558 INFO L131 PetriNetUnfolder]: For 4824/4824 co-relation queries the response was YES. [2022-11-18 19:48:19,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1297 events. 482/1297 cut-off events. For 4824/4824 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8209 event pairs, 150 based on Foata normal form. 30/1264 useless extension candidates. Maximal degree in co-relation 4679. Up to 362 conditions per place. [2022-11-18 19:48:19,574 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 45 selfloop transitions, 10 changer transitions 52/184 dead transitions. [2022-11-18 19:48:19,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 184 transitions, 1277 flow [2022-11-18 19:48:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:48:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:48:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1273 transitions. [2022-11-18 19:48:19,580 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8228829993535876 [2022-11-18 19:48:19,580 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1273 transitions. [2022-11-18 19:48:19,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1273 transitions. [2022-11-18 19:48:19,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:19,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1273 transitions. [2022-11-18 19:48:19,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 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 19:48:19,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:19,589 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:19,589 INFO L175 Difference]: Start difference. First operand has 146 places, 114 transitions, 477 flow. Second operand 13 states and 1273 transitions. [2022-11-18 19:48:19,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 184 transitions, 1277 flow [2022-11-18 19:48:19,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 184 transitions, 1155 flow, removed 61 selfloop flow, removed 15 redundant places. [2022-11-18 19:48:19,618 INFO L231 Difference]: Finished difference. Result has 146 places, 118 transitions, 554 flow [2022-11-18 19:48:19,619 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=554, PETRI_PLACES=146, PETRI_TRANSITIONS=118} [2022-11-18 19:48:19,623 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 22 predicate places. [2022-11-18 19:48:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 118 transitions, 554 flow [2022-11-18 19:48:19,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 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 19:48:19,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:19,625 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] [2022-11-18 19:48:19,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:48:19,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1623463931, now seen corresponding path program 1 times [2022-11-18 19:48:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:19,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923056996] [2022-11-18 19:48:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:20,083 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 19:48:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923056996] [2022-11-18 19:48:20,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923056996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:20,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:20,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:48:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455460920] [2022-11-18 19:48:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:20,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:48:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:48:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:48:20,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-18 19:48:20,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 118 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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 19:48:20,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:20,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-18 19:48:20,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:21,334 INFO L130 PetriNetUnfolder]: 1801/3671 cut-off events. [2022-11-18 19:48:21,335 INFO L131 PetriNetUnfolder]: For 9455/11128 co-relation queries the response was YES. [2022-11-18 19:48:21,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 3671 events. 1801/3671 cut-off events. For 9455/11128 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27971 event pairs, 102 based on Foata normal form. 77/3484 useless extension candidates. Maximal degree in co-relation 10760. Up to 1056 conditions per place. [2022-11-18 19:48:21,384 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 57 selfloop transitions, 13 changer transitions 44/208 dead transitions. [2022-11-18 19:48:21,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 208 transitions, 1435 flow [2022-11-18 19:48:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:48:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:48:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2022-11-18 19:48:21,389 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8747899159663866 [2022-11-18 19:48:21,389 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions. [2022-11-18 19:48:21,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions. [2022-11-18 19:48:21,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:21,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions. [2022-11-18 19:48:21,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 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 19:48:21,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:21,399 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:21,400 INFO L175 Difference]: Start difference. First operand has 146 places, 118 transitions, 554 flow. Second operand 10 states and 1041 transitions. [2022-11-18 19:48:21,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 208 transitions, 1435 flow [2022-11-18 19:48:21,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 208 transitions, 1411 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-18 19:48:21,435 INFO L231 Difference]: Finished difference. Result has 148 places, 129 transitions, 628 flow [2022-11-18 19:48:21,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=628, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2022-11-18 19:48:21,437 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 24 predicate places. [2022-11-18 19:48:21,437 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 628 flow [2022-11-18 19:48:21,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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 19:48:21,438 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:21,439 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 19:48:21,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:48:21,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1684906418, now seen corresponding path program 1 times [2022-11-18 19:48:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:21,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523640664] [2022-11-18 19:48:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:21,870 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 19:48:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523640664] [2022-11-18 19:48:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523640664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:21,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:21,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81093464] [2022-11-18 19:48:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:21,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:21,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-18 19:48:21,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 628 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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 19:48:21,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:21,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-18 19:48:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:23,184 INFO L130 PetriNetUnfolder]: 1548/3376 cut-off events. [2022-11-18 19:48:23,184 INFO L131 PetriNetUnfolder]: For 11550/13310 co-relation queries the response was YES. [2022-11-18 19:48:23,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12598 conditions, 3376 events. 1548/3376 cut-off events. For 11550/13310 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27455 event pairs, 55 based on Foata normal form. 213/3425 useless extension candidates. Maximal degree in co-relation 12531. Up to 661 conditions per place. [2022-11-18 19:48:23,237 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 65 selfloop transitions, 26 changer transitions 54/239 dead transitions. [2022-11-18 19:48:23,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 239 transitions, 1857 flow [2022-11-18 19:48:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:48:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:48:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1352 transitions. [2022-11-18 19:48:23,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8739495798319328 [2022-11-18 19:48:23,244 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1352 transitions. [2022-11-18 19:48:23,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1352 transitions. [2022-11-18 19:48:23,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:23,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1352 transitions. [2022-11-18 19:48:23,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.0) internal successors, (1352), 13 states have internal predecessors, (1352), 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 19:48:23,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:23,256 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:23,257 INFO L175 Difference]: Start difference. First operand has 148 places, 129 transitions, 628 flow. Second operand 13 states and 1352 transitions. [2022-11-18 19:48:23,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 239 transitions, 1857 flow [2022-11-18 19:48:23,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 239 transitions, 1843 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-11-18 19:48:23,303 INFO L231 Difference]: Finished difference. Result has 157 places, 147 transitions, 831 flow [2022-11-18 19:48:23,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=831, PETRI_PLACES=157, PETRI_TRANSITIONS=147} [2022-11-18 19:48:23,304 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 33 predicate places. [2022-11-18 19:48:23,306 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 147 transitions, 831 flow [2022-11-18 19:48:23,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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 19:48:23,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:23,308 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 19:48:23,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:48:23,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1369051213, now seen corresponding path program 1 times [2022-11-18 19:48:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204004206] [2022-11-18 19:48:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:23,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:23,842 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 19:48:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:23,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204004206] [2022-11-18 19:48:23,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204004206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:23,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:23,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:48:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613584025] [2022-11-18 19:48:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:23,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:48:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:48:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:48:23,846 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-18 19:48:23,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 147 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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 19:48:23,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:23,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-18 19:48:23,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:25,223 INFO L130 PetriNetUnfolder]: 1410/3225 cut-off events. [2022-11-18 19:48:25,223 INFO L131 PetriNetUnfolder]: For 14437/16243 co-relation queries the response was YES. [2022-11-18 19:48:25,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13242 conditions, 3225 events. 1410/3225 cut-off events. For 14437/16243 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27364 event pairs, 51 based on Foata normal form. 177/3241 useless extension candidates. Maximal degree in co-relation 13150. Up to 594 conditions per place. [2022-11-18 19:48:25,262 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 55 selfloop transitions, 30 changer transitions 54/233 dead transitions. [2022-11-18 19:48:25,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 233 transitions, 1866 flow [2022-11-18 19:48:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:48:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 19:48:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1631 transitions. [2022-11-18 19:48:25,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8566176470588235 [2022-11-18 19:48:25,268 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1631 transitions. [2022-11-18 19:48:25,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1631 transitions. [2022-11-18 19:48:25,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:25,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1631 transitions. [2022-11-18 19:48:25,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.9375) internal successors, (1631), 16 states have internal predecessors, (1631), 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 19:48:25,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:25,280 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:25,280 INFO L175 Difference]: Start difference. First operand has 157 places, 147 transitions, 831 flow. Second operand 16 states and 1631 transitions. [2022-11-18 19:48:25,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 233 transitions, 1866 flow [2022-11-18 19:48:25,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 233 transitions, 1684 flow, removed 65 selfloop flow, removed 8 redundant places. [2022-11-18 19:48:25,433 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 806 flow [2022-11-18 19:48:25,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=806, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2022-11-18 19:48:25,435 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 47 predicate places. [2022-11-18 19:48:25,435 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 806 flow [2022-11-18 19:48:25,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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 19:48:25,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:25,436 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] [2022-11-18 19:48:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:48:25,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 335358527, now seen corresponding path program 1 times [2022-11-18 19:48:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:25,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635330231] [2022-11-18 19:48:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:25,868 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 19:48:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:25,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635330231] [2022-11-18 19:48:25,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635330231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:25,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:25,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:25,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756459631] [2022-11-18 19:48:25,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:25,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:25,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-18 19:48:25,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 806 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:25,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:25,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-18 19:48:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:26,499 INFO L130 PetriNetUnfolder]: 376/2053 cut-off events. [2022-11-18 19:48:26,499 INFO L131 PetriNetUnfolder]: For 4291/4532 co-relation queries the response was YES. [2022-11-18 19:48:26,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 2053 events. 376/2053 cut-off events. For 4291/4532 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 22195 event pairs, 17 based on Foata normal form. 1/1946 useless extension candidates. Maximal degree in co-relation 5824. Up to 260 conditions per place. [2022-11-18 19:48:26,526 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 20 selfloop transitions, 1 changer transitions 26/163 dead transitions. [2022-11-18 19:48:26,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 163 transitions, 979 flow [2022-11-18 19:48:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:48:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:48:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2022-11-18 19:48:26,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8463385354141657 [2022-11-18 19:48:26,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2022-11-18 19:48:26,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2022-11-18 19:48:26,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:26,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2022-11-18 19:48:26,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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 19:48:26,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:26,537 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:26,537 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 806 flow. Second operand 7 states and 705 transitions. [2022-11-18 19:48:26,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 163 transitions, 979 flow [2022-11-18 19:48:26,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 871 flow, removed 34 selfloop flow, removed 14 redundant places. [2022-11-18 19:48:26,621 INFO L231 Difference]: Finished difference. Result has 165 places, 136 transitions, 612 flow [2022-11-18 19:48:26,621 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=165, PETRI_TRANSITIONS=136} [2022-11-18 19:48:26,623 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 41 predicate places. [2022-11-18 19:48:26,623 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 136 transitions, 612 flow [2022-11-18 19:48:26,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:26,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:26,624 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] [2022-11-18 19:48:26,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:48:26,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1032202179, now seen corresponding path program 2 times [2022-11-18 19:48:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:26,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011571883] [2022-11-18 19:48:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:27,076 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 19:48:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011571883] [2022-11-18 19:48:27,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011571883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:48:27,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:48:27,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:48:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632469567] [2022-11-18 19:48:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:48:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:48:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:48:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:48:27,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-18 19:48:27,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 136 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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 19:48:27,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:48:27,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-18 19:48:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:48:27,508 INFO L130 PetriNetUnfolder]: 231/1312 cut-off events. [2022-11-18 19:48:27,508 INFO L131 PetriNetUnfolder]: For 1723/1737 co-relation queries the response was YES. [2022-11-18 19:48:27,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1312 events. 231/1312 cut-off events. For 1723/1737 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 12981 event pairs, 13 based on Foata normal form. 1/1249 useless extension candidates. Maximal degree in co-relation 3421. Up to 162 conditions per place. [2022-11-18 19:48:27,522 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 18 selfloop transitions, 6 changer transitions 17/145 dead transitions. [2022-11-18 19:48:27,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 720 flow [2022-11-18 19:48:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:48:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:48:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2022-11-18 19:48:27,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8091236494597839 [2022-11-18 19:48:27,528 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 674 transitions. [2022-11-18 19:48:27,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 674 transitions. [2022-11-18 19:48:27,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:48:27,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 674 transitions. [2022-11-18 19:48:27,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 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 19:48:27,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:27,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:27,563 INFO L175 Difference]: Start difference. First operand has 165 places, 136 transitions, 612 flow. Second operand 7 states and 674 transitions. [2022-11-18 19:48:27,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 145 transitions, 720 flow [2022-11-18 19:48:27,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 145 transitions, 664 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-11-18 19:48:27,596 INFO L231 Difference]: Finished difference. Result has 160 places, 127 transitions, 516 flow [2022-11-18 19:48:27,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=160, PETRI_TRANSITIONS=127} [2022-11-18 19:48:27,597 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 36 predicate places. [2022-11-18 19:48:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 127 transitions, 516 flow [2022-11-18 19:48:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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 19:48:27,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:48:27,599 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] [2022-11-18 19:48:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:48:27,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:48:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1137288127, now seen corresponding path program 3 times [2022-11-18 19:48:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878557875] [2022-11-18 19:48:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:48:27,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:48:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:48:27,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:48:27,772 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:48:27,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 19:48:27,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 19:48:27,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 19:48:27,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 19:48:27,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 19:48:27,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 19:48:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:48:27,777 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:48:27,785 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:48:27,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:48:27,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:48:27 BasicIcfg [2022-11-18 19:48:27,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:48:27,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:48:27,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:48:27,939 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:48:27,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:48:12" (3/4) ... [2022-11-18 19:48:27,941 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:48:28,102 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:48:28,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:48:28,103 INFO L158 Benchmark]: Toolchain (without parser) took 18044.35ms. Allocated memory was 132.1MB in the beginning and 474.0MB in the end (delta: 341.8MB). Free memory was 93.7MB in the beginning and 325.3MB in the end (delta: -231.7MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,104 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory was 111.5MB in the beginning and 111.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:48:28,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 926.09ms. Allocated memory is still 132.1MB. Free memory was 93.4MB in the beginning and 92.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.28ms. Allocated memory is still 132.1MB. Free memory was 92.2MB in the beginning and 89.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,105 INFO L158 Benchmark]: Boogie Preprocessor took 76.42ms. Allocated memory is still 132.1MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,106 INFO L158 Benchmark]: RCFGBuilder took 1163.12ms. Allocated memory is still 132.1MB. Free memory was 87.4MB in the beginning and 100.7MB in the end (delta: -13.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,106 INFO L158 Benchmark]: TraceAbstraction took 15601.27ms. Allocated memory was 132.1MB in the beginning and 474.0MB in the end (delta: 341.8MB). Free memory was 99.9MB in the beginning and 350.5MB in the end (delta: -250.6MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,107 INFO L158 Benchmark]: Witness Printer took 163.89ms. Allocated memory is still 474.0MB. Free memory was 350.5MB in the beginning and 325.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-18 19:48:28,110 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.36ms. Allocated memory is still 132.1MB. Free memory was 111.5MB in the beginning and 111.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 926.09ms. Allocated memory is still 132.1MB. Free memory was 93.4MB in the beginning and 92.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.28ms. Allocated memory is still 132.1MB. Free memory was 92.2MB in the beginning and 89.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.42ms. Allocated memory is still 132.1MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1163.12ms. Allocated memory is still 132.1MB. Free memory was 87.4MB in the beginning and 100.7MB in the end (delta: -13.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15601.27ms. Allocated memory was 132.1MB in the beginning and 474.0MB in the end (delta: 341.8MB). Free memory was 99.9MB in the beginning and 350.5MB in the end (delta: -250.6MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Witness Printer took 163.89ms. Allocated memory is still 474.0MB. Free memory was 350.5MB in the beginning and 325.3MB 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: [L717] 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] [L728] 0 _Bool z$flush_delayed; VAL [__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_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_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_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] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__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_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_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_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_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] [L719] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=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] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L851] 0 pthread_t t284; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284={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] [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=-2, t284={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] [L853] 0 pthread_t t285; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t284={5:0}, t285={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] [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={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] [L855] 0 pthread_t t286; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={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=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] [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={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=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] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, 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] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 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) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, 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] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, 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] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, 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] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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=1, 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] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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=1, 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] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, 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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, 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] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, 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=1, 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] [L829] 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) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 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 [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 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 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=50, weak$$choice2=0, x=2, y=1, z=1, 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=1, 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: 852]: 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: 854]: 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: 856]: 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, 147 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: 15.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 618 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1146 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 147 mSDtfsCounter, 1146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=7, InterpolantAutomatonStates: 104, 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.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 2837 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 19:48:28,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75942f99-aa6f-48dc-8bc1-20c89183dab7/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