./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a --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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- 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-b5237d8 [2022-11-21 17:23:04,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:23:04,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:23:04,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:23:04,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:23:04,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:23:04,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:23:04,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:23:04,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:23:04,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:23:04,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:23:04,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:23:04,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:23:04,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:23:04,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:23:04,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:23:04,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:23:04,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:23:04,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:23:04,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:23:04,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:23:04,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:23:04,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:23:04,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:23:04,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:23:04,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:23:04,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:23:04,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:23:04,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:23:04,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:23:04,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:23:04,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:23:04,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:23:04,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:23:04,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:23:04,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:23:04,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:23:04,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:23:04,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:23:04,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:23:04,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:23:04,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 17:23:04,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:23:04,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:23:04,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:23:04,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:23:04,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:23:04,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:23:04,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:23:04,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:23:04,439 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:23:04,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:23:04,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:23:04,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:23:04,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:23:04,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:23:04,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:23:04,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:23:04,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:23:04,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:23:04,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:23:04,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:04,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:23:04,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:23:04,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:23:04,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:23:04,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:23:04,444 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:23:04,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:23:04,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:23:04,445 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_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/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_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2022-11-21 17:23:04,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:23:04,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:23:04,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:23:04,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:23:04,775 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:23:04,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:23:07,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:23:08,099 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:23:08,100 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:23:08,122 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/data/da705d30c/021ddace5ec84da1bb4fa580b4b077f3/FLAG16cf6a5d4 [2022-11-21 17:23:08,139 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/data/da705d30c/021ddace5ec84da1bb4fa580b4b077f3 [2022-11-21 17:23:08,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:23:08,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:23:08,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:08,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:23:08,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:23:08,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389e4606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08, skipping insertion in model container [2022-11-21 17:23:08,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:23:08,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:23:08,421 WARN L237 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_f3830fea-570e-4110-94d4-64162acfdca0/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 17:23:08,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:08,690 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:23:08,708 WARN L237 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_f3830fea-570e-4110-94d4-64162acfdca0/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 17:23:08,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:08,833 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:23:08,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08 WrapperNode [2022-11-21 17:23:08,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:08,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:08,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:23:08,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:23:08,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,882 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-21 17:23:08,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:08,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:23:08,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:23:08,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:23:08,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:23:08,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:23:08,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:23:08,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:23:08,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (1/1) ... [2022-11-21 17:23:08,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:08,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:08,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:23:08,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:23:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:23:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:23:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:23:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:23:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:23:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 17:23:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 17:23:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 17:23:09,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 17:23:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 17:23:09,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 17:23:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:23:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:23:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:23:09,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:23:09,018 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:23:09,259 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:23:09,261 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:23:09,699 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:23:09,857 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:23:09,857 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:23:09,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:09 BoogieIcfgContainer [2022-11-21 17:23:09,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:23:09,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:23:09,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:23:09,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:23:09,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:23:08" (1/3) ... [2022-11-21 17:23:09,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d82d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:09, skipping insertion in model container [2022-11-21 17:23:09,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:08" (2/3) ... [2022-11-21 17:23:09,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d82d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:09, skipping insertion in model container [2022-11-21 17:23:09,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:09" (3/3) ... [2022-11-21 17:23:09,870 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:23:09,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 17:23:09,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:23:09,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 17:23:09,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:23:09,951 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:23:09,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-21 17:23:10,087 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-21 17:23:10,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:23:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-21 17:23:10,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-11-21 17:23:10,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-11-21 17:23:10,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:23:10,131 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;@16cbfd00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:23:10,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 17:23:10,151 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2022-11-21 17:23:10,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:23:10,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:10,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:10,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -532993726, now seen corresponding path program 1 times [2022-11-21 17:23:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:10,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991550174] [2022-11-21 17:23:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:10,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-21 17:23:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:10,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991550174] [2022-11-21 17:23:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991550174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:10,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:10,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:23:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905738267] [2022-11-21 17:23:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:10,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:23:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:23:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:23:10,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2022-11-21 17:23:10,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-21 17:23:10,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:10,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2022-11-21 17:23:10,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:11,126 INFO L130 PetriNetUnfolder]: 58/329 cut-off events. [2022-11-21 17:23:11,126 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-21 17:23:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 329 events. 58/329 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1407 event pairs, 44 based on Foata normal form. 18/327 useless extension candidates. Maximal degree in co-relation 403. Up to 79 conditions per place. [2022-11-21 17:23:11,133 INFO L137 encePairwiseOnDemand]: 116/121 looper letters, 14 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-11-21 17:23:11,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 287 flow [2022-11-21 17:23:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:23:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:23:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2022-11-21 17:23:11,145 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2022-11-21 17:23:11,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2022-11-21 17:23:11,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2022-11-21 17:23:11,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:11,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2022-11-21 17:23:11,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-21 17:23:11,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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-21 17:23:11,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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-21 17:23:11,162 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 342 transitions. [2022-11-21 17:23:11,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 287 flow [2022-11-21 17:23:11,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 120 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:23:11,169 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 238 flow [2022-11-21 17:23:11,171 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2022-11-21 17:23:11,174 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2022-11-21 17:23:11,175 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 238 flow [2022-11-21 17:23:11,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-21 17:23:11,175 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:11,176 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-21 17:23:11,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:23:11,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash -791629445, now seen corresponding path program 1 times [2022-11-21 17:23:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:11,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606483302] [2022-11-21 17:23:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:11,694 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-21 17:23:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606483302] [2022-11-21 17:23:11,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606483302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:11,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:23:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634869043] [2022-11-21 17:23:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:11,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:23:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:23:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:23:11,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-21 17:23:11,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 238 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-21 17:23:11,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:11,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-21 17:23:11,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:13,693 INFO L130 PetriNetUnfolder]: 3140/7889 cut-off events. [2022-11-21 17:23:13,693 INFO L131 PetriNetUnfolder]: For 260/260 co-relation queries the response was YES. [2022-11-21 17:23:13,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12907 conditions, 7889 events. 3140/7889 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 73578 event pairs, 817 based on Foata normal form. 0/7642 useless extension candidates. Maximal degree in co-relation 12848. Up to 2148 conditions per place. [2022-11-21 17:23:13,736 INFO L137 encePairwiseOnDemand]: 106/121 looper letters, 30 selfloop transitions, 11 changer transitions 82/200 dead transitions. [2022-11-21 17:23:13,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 200 transitions, 650 flow [2022-11-21 17:23:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:23:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 17:23:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2022-11-21 17:23:13,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8567493112947658 [2022-11-21 17:23:13,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 933 transitions. [2022-11-21 17:23:13,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 933 transitions. [2022-11-21 17:23:13,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:13,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 933 transitions. [2022-11-21 17:23:13,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 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-21 17:23:13,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:13,754 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:13,754 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 238 flow. Second operand 9 states and 933 transitions. [2022-11-21 17:23:13,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 200 transitions, 650 flow [2022-11-21 17:23:13,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 200 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:23:13,761 INFO L231 Difference]: Finished difference. Result has 137 places, 108 transitions, 328 flow [2022-11-21 17:23:13,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=328, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2022-11-21 17:23:13,763 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2022-11-21 17:23:13,763 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 328 flow [2022-11-21 17:23:13,763 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-21 17:23:13,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:13,764 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-21 17:23:13,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:23:13,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 612587164, now seen corresponding path program 1 times [2022-11-21 17:23:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:13,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444358151] [2022-11-21 17:23:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:14,137 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-21 17:23:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444358151] [2022-11-21 17:23:14,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444358151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:14,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:14,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:23:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862990333] [2022-11-21 17:23:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:14,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:23:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:23:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:14,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-21 17:23:14,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 328 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-21 17:23:14,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:14,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-21 17:23:14,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:15,500 INFO L130 PetriNetUnfolder]: 2089/4153 cut-off events. [2022-11-21 17:23:15,500 INFO L131 PetriNetUnfolder]: For 6463/6520 co-relation queries the response was YES. [2022-11-21 17:23:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 4153 events. 2089/4153 cut-off events. For 6463/6520 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 29455 event pairs, 535 based on Foata normal form. 116/4134 useless extension candidates. Maximal degree in co-relation 12159. Up to 1155 conditions per place. [2022-11-21 17:23:15,529 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 43 selfloop transitions, 7 changer transitions 88/215 dead transitions. [2022-11-21 17:23:15,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 215 transitions, 1164 flow [2022-11-21 17:23:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:23:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 17:23:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1307 transitions. [2022-11-21 17:23:15,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8308963763509218 [2022-11-21 17:23:15,534 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1307 transitions. [2022-11-21 17:23:15,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1307 transitions. [2022-11-21 17:23:15,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:15,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1307 transitions. [2022-11-21 17:23:15,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.53846153846153) internal successors, (1307), 13 states have internal predecessors, (1307), 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-21 17:23:15,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:15,543 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:15,543 INFO L175 Difference]: Start difference. First operand has 137 places, 108 transitions, 328 flow. Second operand 13 states and 1307 transitions. [2022-11-21 17:23:15,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 215 transitions, 1164 flow [2022-11-21 17:23:15,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 215 transitions, 1058 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-21 17:23:15,566 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 384 flow [2022-11-21 17:23:15,566 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=384, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2022-11-21 17:23:15,567 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places. [2022-11-21 17:23:15,567 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 384 flow [2022-11-21 17:23:15,568 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-21 17:23:15,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:15,568 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] [2022-11-21 17:23:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:23:15,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1647605693, now seen corresponding path program 1 times [2022-11-21 17:23:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:15,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392294724] [2022-11-21 17:23:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:15,831 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-21 17:23:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:15,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392294724] [2022-11-21 17:23:15,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392294724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:15,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:15,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:23:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516078891] [2022-11-21 17:23:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:15,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:23:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:23:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:15,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-21 17:23:15,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 384 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-21 17:23:15,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:15,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-21 17:23:15,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:17,003 INFO L130 PetriNetUnfolder]: 1511/3076 cut-off events. [2022-11-21 17:23:17,003 INFO L131 PetriNetUnfolder]: For 7552/7555 co-relation queries the response was YES. [2022-11-21 17:23:17,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9872 conditions, 3076 events. 1511/3076 cut-off events. For 7552/7555 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20624 event pairs, 222 based on Foata normal form. 72/3070 useless extension candidates. Maximal degree in co-relation 9789. Up to 980 conditions per place. [2022-11-21 17:23:17,038 INFO L137 encePairwiseOnDemand]: 108/121 looper letters, 40 selfloop transitions, 13 changer transitions 70/200 dead transitions. [2022-11-21 17:23:17,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 200 transitions, 1138 flow [2022-11-21 17:23:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:23:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 17:23:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1295 transitions. [2022-11-21 17:23:17,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232676414494596 [2022-11-21 17:23:17,043 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1295 transitions. [2022-11-21 17:23:17,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1295 transitions. [2022-11-21 17:23:17,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:17,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1295 transitions. [2022-11-21 17:23:17,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.61538461538461) internal successors, (1295), 13 states have internal predecessors, (1295), 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-21 17:23:17,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:17,053 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:17,053 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 384 flow. Second operand 13 states and 1295 transitions. [2022-11-21 17:23:17,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 200 transitions, 1138 flow [2022-11-21 17:23:17,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 200 transitions, 1053 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-11-21 17:23:17,131 INFO L231 Difference]: Finished difference. Result has 149 places, 116 transitions, 488 flow [2022-11-21 17:23:17,132 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=488, PETRI_PLACES=149, PETRI_TRANSITIONS=116} [2022-11-21 17:23:17,132 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 23 predicate places. [2022-11-21 17:23:17,133 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 116 transitions, 488 flow [2022-11-21 17:23:17,133 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-21 17:23:17,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:17,134 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-21 17:23:17,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:23:17,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2071811372, now seen corresponding path program 1 times [2022-11-21 17:23:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826733797] [2022-11-21 17:23:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:17,388 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-21 17:23:17,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:17,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826733797] [2022-11-21 17:23:17,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826733797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:17,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:17,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:23:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532626967] [2022-11-21 17:23:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:17,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:23:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:23:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:23:17,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-21 17:23:17,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 116 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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-21 17:23:17,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:17,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-21 17:23:17,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:18,734 INFO L130 PetriNetUnfolder]: 2698/5703 cut-off events. [2022-11-21 17:23:18,734 INFO L131 PetriNetUnfolder]: For 7647/9912 co-relation queries the response was YES. [2022-11-21 17:23:18,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13509 conditions, 5703 events. 2698/5703 cut-off events. For 7647/9912 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47101 event pairs, 210 based on Foata normal form. 43/5488 useless extension candidates. Maximal degree in co-relation 13419. Up to 1414 conditions per place. [2022-11-21 17:23:18,795 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 82 selfloop transitions, 17 changer transitions 4/197 dead transitions. [2022-11-21 17:23:18,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 197 transitions, 1084 flow [2022-11-21 17:23:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:23:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 17:23:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1059 transitions. [2022-11-21 17:23:18,799 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8752066115702479 [2022-11-21 17:23:18,800 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1059 transitions. [2022-11-21 17:23:18,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1059 transitions. [2022-11-21 17:23:18,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:18,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1059 transitions. [2022-11-21 17:23:18,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 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-21 17:23:18,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:18,807 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:18,807 INFO L175 Difference]: Start difference. First operand has 149 places, 116 transitions, 488 flow. Second operand 10 states and 1059 transitions. [2022-11-21 17:23:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 197 transitions, 1084 flow [2022-11-21 17:23:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 197 transitions, 998 flow, removed 41 selfloop flow, removed 10 redundant places. [2022-11-21 17:23:18,826 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 564 flow [2022-11-21 17:23:18,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=564, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2022-11-21 17:23:18,830 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 19 predicate places. [2022-11-21 17:23:18,830 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 564 flow [2022-11-21 17:23:18,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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-21 17:23:18,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:18,831 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] [2022-11-21 17:23:18,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:23:18,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2006163874, now seen corresponding path program 1 times [2022-11-21 17:23:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089950172] [2022-11-21 17:23:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:19,235 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-21 17:23:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:19,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089950172] [2022-11-21 17:23:19,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089950172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:19,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:19,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:23:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143050022] [2022-11-21 17:23:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:23:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:23:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:19,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2022-11-21 17:23:19,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 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-21 17:23:19,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:19,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2022-11-21 17:23:19,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:20,288 INFO L130 PetriNetUnfolder]: 1191/4140 cut-off events. [2022-11-21 17:23:20,289 INFO L131 PetriNetUnfolder]: For 4985/5398 co-relation queries the response was YES. [2022-11-21 17:23:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10648 conditions, 4140 events. 1191/4140 cut-off events. For 4985/5398 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 42630 event pairs, 287 based on Foata normal form. 118/4020 useless extension candidates. Maximal degree in co-relation 10558. Up to 757 conditions per place. [2022-11-21 17:23:20,338 INFO L137 encePairwiseOnDemand]: 115/121 looper letters, 60 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2022-11-21 17:23:20,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 172 transitions, 910 flow [2022-11-21 17:23:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:23:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 17:23:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2022-11-21 17:23:20,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.859504132231405 [2022-11-21 17:23:20,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2022-11-21 17:23:20,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2022-11-21 17:23:20,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:20,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2022-11-21 17:23:20,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 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-21 17:23:20,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 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-21 17:23:20,346 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 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-21 17:23:20,347 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 564 flow. Second operand 7 states and 728 transitions. [2022-11-21 17:23:20,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 172 transitions, 910 flow [2022-11-21 17:23:20,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 172 transitions, 890 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-21 17:23:20,380 INFO L231 Difference]: Finished difference. Result has 149 places, 136 transitions, 625 flow [2022-11-21 17:23:20,381 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=625, PETRI_PLACES=149, PETRI_TRANSITIONS=136} [2022-11-21 17:23:20,382 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 23 predicate places. [2022-11-21 17:23:20,382 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 136 transitions, 625 flow [2022-11-21 17:23:20,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 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-21 17:23:20,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:20,383 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] [2022-11-21 17:23:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:23:20,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1172728922, now seen corresponding path program 2 times [2022-11-21 17:23:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:20,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234333029] [2022-11-21 17:23:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:20,743 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-21 17:23:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234333029] [2022-11-21 17:23:20,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234333029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:20,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:20,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:23:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256539416] [2022-11-21 17:23:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:20,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:23:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:23:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:20,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-21 17:23:20,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 136 transitions, 625 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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-21 17:23:20,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:20,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-21 17:23:20,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:22,924 INFO L130 PetriNetUnfolder]: 4080/8676 cut-off events. [2022-11-21 17:23:22,924 INFO L131 PetriNetUnfolder]: For 14853/17765 co-relation queries the response was YES. [2022-11-21 17:23:22,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26024 conditions, 8676 events. 4080/8676 cut-off events. For 14853/17765 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 79664 event pairs, 257 based on Foata normal form. 214/8641 useless extension candidates. Maximal degree in co-relation 25936. Up to 1426 conditions per place. [2022-11-21 17:23:23,005 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 77 selfloop transitions, 32 changer transitions 34/239 dead transitions. [2022-11-21 17:23:23,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 239 transitions, 1491 flow [2022-11-21 17:23:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:23:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 17:23:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1380 transitions. [2022-11-21 17:23:23,010 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.87730451366815 [2022-11-21 17:23:23,010 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1380 transitions. [2022-11-21 17:23:23,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1380 transitions. [2022-11-21 17:23:23,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:23,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1380 transitions. [2022-11-21 17:23:23,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.15384615384616) internal successors, (1380), 13 states have internal predecessors, (1380), 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-21 17:23:23,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:23,019 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 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-21 17:23:23,019 INFO L175 Difference]: Start difference. First operand has 149 places, 136 transitions, 625 flow. Second operand 13 states and 1380 transitions. [2022-11-21 17:23:23,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 239 transitions, 1491 flow [2022-11-21 17:23:23,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 239 transitions, 1488 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-21 17:23:23,151 INFO L231 Difference]: Finished difference. Result has 164 places, 153 transitions, 839 flow [2022-11-21 17:23:23,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=839, PETRI_PLACES=164, PETRI_TRANSITIONS=153} [2022-11-21 17:23:23,152 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 38 predicate places. [2022-11-21 17:23:23,153 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 153 transitions, 839 flow [2022-11-21 17:23:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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-21 17:23:23,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:23,154 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] [2022-11-21 17:23:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:23:23,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1562002560, now seen corresponding path program 1 times [2022-11-21 17:23:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:23,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135849402] [2022-11-21 17:23:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:23,615 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-21 17:23:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:23,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135849402] [2022-11-21 17:23:23,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135849402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:23,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:23,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:23:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323335760] [2022-11-21 17:23:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:23,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:23:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:23:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:23:23,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-21 17:23:23,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 153 transitions, 839 flow. Second operand has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 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-21 17:23:23,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:23:23,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-21 17:23:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:23:25,707 INFO L130 PetriNetUnfolder]: 3898/8282 cut-off events. [2022-11-21 17:23:25,707 INFO L131 PetriNetUnfolder]: For 21506/24409 co-relation queries the response was YES. [2022-11-21 17:23:25,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28043 conditions, 8282 events. 3898/8282 cut-off events. For 21506/24409 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 77067 event pairs, 254 based on Foata normal form. 98/8133 useless extension candidates. Maximal degree in co-relation 28012. Up to 1289 conditions per place. [2022-11-21 17:23:25,745 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 42 selfloop transitions, 22 changer transitions 83/235 dead transitions. [2022-11-21 17:23:25,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 235 transitions, 1593 flow [2022-11-21 17:23:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:23:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-21 17:23:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1660 transitions. [2022-11-21 17:23:25,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8574380165289256 [2022-11-21 17:23:25,755 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1660 transitions. [2022-11-21 17:23:25,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1660 transitions. [2022-11-21 17:23:25,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:23:25,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1660 transitions. [2022-11-21 17:23:25,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 103.75) internal successors, (1660), 16 states have internal predecessors, (1660), 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-21 17:23:25,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 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-21 17:23:25,765 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 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-21 17:23:25,765 INFO L175 Difference]: Start difference. First operand has 164 places, 153 transitions, 839 flow. Second operand 16 states and 1660 transitions. [2022-11-21 17:23:25,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 235 transitions, 1593 flow [2022-11-21 17:23:26,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 235 transitions, 1423 flow, removed 68 selfloop flow, removed 11 redundant places. [2022-11-21 17:23:26,273 INFO L231 Difference]: Finished difference. Result has 172 places, 129 transitions, 592 flow [2022-11-21 17:23:26,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=592, PETRI_PLACES=172, PETRI_TRANSITIONS=129} [2022-11-21 17:23:26,274 INFO L288 CegarLoopForPetriNet]: 126 programPoint places, 46 predicate places. [2022-11-21 17:23:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 129 transitions, 592 flow [2022-11-21 17:23:26,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 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-21 17:23:26,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:23:26,275 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:23:26,276 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 17:23:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 908901979, now seen corresponding path program 1 times [2022-11-21 17:23:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:26,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003378347] [2022-11-21 17:23:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:26,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:26,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:26,444 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:23:26,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-21 17:23:26,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 17:23:26,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-21 17:23:26,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-21 17:23:26,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-21 17:23:26,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 17:23:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:23:26,448 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:26,455 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:23:26,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:23:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:23:26 BasicIcfg [2022-11-21 17:23:26,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:23:26,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:23:26,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:23:26,592 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:23:26,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:09" (3/4) ... [2022-11-21 17:23:26,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:23:26,756 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:23:26,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:23:26,756 INFO L158 Benchmark]: Toolchain (without parser) took 18612.80ms. Allocated memory was 192.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 161.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 511.0MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,757 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:23:26,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.44ms. Allocated memory is still 192.9MB. Free memory was 161.2MB in the beginning and 137.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.41ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,758 INFO L158 Benchmark]: Boogie Preprocessor took 32.48ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,758 INFO L158 Benchmark]: RCFGBuilder took 943.60ms. Allocated memory is still 192.9MB. Free memory was 133.4MB in the beginning and 97.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,759 INFO L158 Benchmark]: TraceAbstraction took 16729.01ms. Allocated memory was 192.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 97.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 420.8MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,759 INFO L158 Benchmark]: Witness Printer took 164.71ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-21 17:23:26,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.44ms. Allocated memory is still 192.9MB. Free memory was 161.2MB in the beginning and 137.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.41ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.48ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 943.60ms. Allocated memory is still 192.9MB. Free memory was 133.4MB in the beginning and 97.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16729.01ms. Allocated memory was 192.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 97.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 420.8MB. Max. memory is 16.1GB. * Witness Printer took 164.71ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L721] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L723] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L724] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L732] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L733] 0 _Bool a$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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L734] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L735] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L741] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] 0 pthread_t t281; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t281, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t282, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t283, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$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=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L771] 1 __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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L833] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L855] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L857] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L866] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L868] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=1, x=2, y=1, z=1] [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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: 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, 151 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: 16.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1108 IncrementalHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 118 mSDtfsCounter, 1108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 2985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-21 17:23:26,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830fea-570e-4110-94d4-64162acfdca0/bin/uautomizer-vX5HgA9Q3a/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