./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc --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 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- 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-5e519f3 [2022-11-02 20:56:44,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:44,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:44,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:44,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:44,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:44,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:44,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:44,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:44,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:44,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:44,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:44,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:44,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:44,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:44,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:44,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:44,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:44,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:44,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:44,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:44,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:44,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:44,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:44,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:44,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:44,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:44,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:44,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:44,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:44,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:44,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:44,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:44,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:44,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:44,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:44,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:44,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:44,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:44,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:44,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:44,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:56:44,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:44,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:44,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:44,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:44,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:44,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:44,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:44,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:44,935 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:44,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:44,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:56:44,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:44,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:56:44,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:44,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:56:44,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:44,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:56:44,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:56:44,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:56:44,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:44,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:56:44,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:44,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:44,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:44,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:44,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:44,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:44,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:56:44,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:44,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:44,943 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:56:44,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:56:44,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:56:44,944 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_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/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_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc 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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2022-11-02 20:56:45,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:45,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:45,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:45,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:45,376 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:45,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:56:45,444 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/data/91c206bca/27f2c98d14b543c39424c8d7e49a84e6/FLAG3a6706ec7 [2022-11-02 20:56:46,000 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:46,003 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:56:46,024 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/data/91c206bca/27f2c98d14b543c39424c8d7e49a84e6/FLAG3a6706ec7 [2022-11-02 20:56:46,277 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/data/91c206bca/27f2c98d14b543c39424c8d7e49a84e6 [2022-11-02 20:56:46,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:46,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:46,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:46,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:46,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:46,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:46" (1/1) ... [2022-11-02 20:56:46,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9931d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:46, skipping insertion in model container [2022-11-02 20:56:46,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:46" (1/1) ... [2022-11-02 20:56:46,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:46,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:46,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-02 20:56:46,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:46,854 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:46,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-02 20:56:46,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:47,054 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:47,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47 WrapperNode [2022-11-02 20:56:47,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:47,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:47,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:47,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:47,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,156 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 267 [2022-11-02 20:56:47,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:47,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:47,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:47,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:47,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:47,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:47,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:47,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:47,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (1/1) ... [2022-11-02 20:56:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:47,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:47,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:47,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:56:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:56:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:56:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:56:47,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:56:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:56:47,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:56:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:56:47,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:47,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:47,364 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:56:47,652 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:47,654 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:48,344 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:48,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:48,838 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:56:48,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:48 BoogieIcfgContainer [2022-11-02 20:56:48,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:48,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:48,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:48,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:48,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:46" (1/3) ... [2022-11-02 20:56:48,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686bde6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:48, skipping insertion in model container [2022-11-02 20:56:48,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:47" (2/3) ... [2022-11-02 20:56:48,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686bde6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:48, skipping insertion in model container [2022-11-02 20:56:48,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:48" (3/3) ... [2022-11-02 20:56:48,852 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-02 20:56:48,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:56:48,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:48,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:56:48,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:56:48,955 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:56:48,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-02 20:56:49,051 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-02 20:56:49,051 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:56:49,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-02 20:56:49,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-11-02 20:56:49,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-11-02 20:56:49,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:56:49,081 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;@126da0ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:56:49,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:56:49,107 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-02 20:56:49,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:56:49,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:49,112 INFO L208 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] [2022-11-02 20:56:49,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1181332090, now seen corresponding path program 1 times [2022-11-02 20:56:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326369099] [2022-11-02 20:56:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:49,833 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-02 20:56:49,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326369099] [2022-11-02 20:56:49,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326369099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:49,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:49,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561950617] [2022-11-02 20:56:49,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:49,881 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-11-02 20:56:49,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-02 20:56:49,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:49,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-11-02 20:56:49,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:50,090 INFO L130 PetriNetUnfolder]: 17/220 cut-off events. [2022-11-02 20:56:50,090 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:56:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 220 events. 17/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 701 event pairs, 7 based on Foata normal form. 9/218 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2022-11-02 20:56:50,098 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 9 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-11-02 20:56:50,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 218 flow [2022-11-02 20:56:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-11-02 20:56:50,128 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9319727891156463 [2022-11-02 20:56:50,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2022-11-02 20:56:50,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2022-11-02 20:56:50,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:50,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2022-11-02 20:56:50,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-02 20:56:50,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-02 20:56:50,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-02 20:56:50,161 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 274 transitions. [2022-11-02 20:56:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 218 flow [2022-11-02 20:56:50,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:50,174 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-11-02 20:56:50,177 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-11-02 20:56:50,183 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-11-02 20:56:50,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-11-02 20:56:50,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-02 20:56:50,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:50,186 INFO L208 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] [2022-11-02 20:56:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:56:50,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1123567931, now seen corresponding path program 1 times [2022-11-02 20:56:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490562562] [2022-11-02 20:56:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:50,825 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-02 20:56:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490562562] [2022-11-02 20:56:50,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490562562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:50,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:50,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228966667] [2022-11-02 20:56:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:50,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:50,839 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98 [2022-11-02 20:56:50,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 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-02 20:56:50,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:50,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98 [2022-11-02 20:56:50,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:51,269 INFO L130 PetriNetUnfolder]: 84/381 cut-off events. [2022-11-02 20:56:51,269 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:56:51,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 381 events. 84/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1911 event pairs, 18 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 523. Up to 65 conditions per place. [2022-11-02 20:56:51,272 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 34/118 dead transitions. [2022-11-02 20:56:51,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 332 flow [2022-11-02 20:56:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:56:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:56:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 754 transitions. [2022-11-02 20:56:51,275 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-11-02 20:56:51,275 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 754 transitions. [2022-11-02 20:56:51,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 754 transitions. [2022-11-02 20:56:51,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:51,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 754 transitions. [2022-11-02 20:56:51,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 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-02 20:56:51,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-02 20:56:51,282 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-02 20:56:51,282 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 754 transitions. [2022-11-02 20:56:51,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 332 flow [2022-11-02 20:56:51,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:51,285 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-11-02 20:56:51,285 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-11-02 20:56:51,286 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-11-02 20:56:51,286 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-11-02 20:56:51,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 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-02 20:56:51,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:51,287 INFO L208 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] [2022-11-02 20:56:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:56:51,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 305124856, now seen corresponding path program 1 times [2022-11-02 20:56:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:51,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780199299] [2022-11-02 20:56:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,427 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-02 20:56:52,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780199299] [2022-11-02 20:56:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780199299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:52,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:52,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:56:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607836309] [2022-11-02 20:56:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:52,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:56:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:56:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:56:52,434 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-02 20:56:52,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 78.625) internal successors, (629), 8 states have internal predecessors, (629), 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-02 20:56:52,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:52,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-02 20:56:52,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:52,855 INFO L130 PetriNetUnfolder]: 66/262 cut-off events. [2022-11-02 20:56:52,855 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-02 20:56:52,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 262 events. 66/262 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1018 event pairs, 24 based on Foata normal form. 6/259 useless extension candidates. Maximal degree in co-relation 440. Up to 85 conditions per place. [2022-11-02 20:56:52,861 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 16 selfloop transitions, 5 changer transitions 22/109 dead transitions. [2022-11-02 20:56:52,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 348 flow [2022-11-02 20:56:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:56:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 892 transitions. [2022-11-02 20:56:52,865 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8274582560296846 [2022-11-02 20:56:52,865 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 892 transitions. [2022-11-02 20:56:52,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 892 transitions. [2022-11-02 20:56:52,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:52,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 892 transitions. [2022-11-02 20:56:52,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.0909090909091) internal successors, (892), 11 states have internal predecessors, (892), 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-02 20:56:52,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:52,874 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:52,874 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 11 states and 892 transitions. [2022-11-02 20:56:52,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 348 flow [2022-11-02 20:56:52,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 109 transitions, 316 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-02 20:56:52,885 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 219 flow [2022-11-02 20:56:52,885 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=219, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2022-11-02 20:56:52,888 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2022-11-02 20:56:52,889 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 219 flow [2022-11-02 20:56:52,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.625) internal successors, (629), 8 states have internal predecessors, (629), 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-02 20:56:52,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:52,891 INFO L208 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] [2022-11-02 20:56:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:56:52,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash -535115785, now seen corresponding path program 1 times [2022-11-02 20:56:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:52,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780080317] [2022-11-02 20:56:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:53,375 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-02 20:56:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:53,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780080317] [2022-11-02 20:56:53,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780080317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:53,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:53,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019026689] [2022-11-02 20:56:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:53,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:53,385 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-02 20:56:53,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-02 20:56:53,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:53,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-02 20:56:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:53,762 INFO L130 PetriNetUnfolder]: 144/452 cut-off events. [2022-11-02 20:56:53,762 INFO L131 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2022-11-02 20:56:53,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 452 events. 144/452 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2235 event pairs, 11 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 915. Up to 86 conditions per place. [2022-11-02 20:56:53,766 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 24 selfloop transitions, 6 changer transitions 35/131 dead transitions. [2022-11-02 20:56:53,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 131 transitions, 507 flow [2022-11-02 20:56:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:56:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:56:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 834 transitions. [2022-11-02 20:56:53,770 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8510204081632653 [2022-11-02 20:56:53,770 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 834 transitions. [2022-11-02 20:56:53,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 834 transitions. [2022-11-02 20:56:53,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:53,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 834 transitions. [2022-11-02 20:56:53,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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-02 20:56:53,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-02 20:56:53,777 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-02 20:56:53,777 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 219 flow. Second operand 10 states and 834 transitions. [2022-11-02 20:56:53,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 131 transitions, 507 flow [2022-11-02 20:56:53,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 492 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-02 20:56:53,783 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 256 flow [2022-11-02 20:56:53,784 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2022-11-02 20:56:53,785 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2022-11-02 20:56:53,785 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 256 flow [2022-11-02 20:56:53,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-02 20:56:53,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:53,786 INFO L208 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] [2022-11-02 20:56:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:56:53,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -393238058, now seen corresponding path program 1 times [2022-11-02 20:56:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:53,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333777841] [2022-11-02 20:56:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:54,189 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-02 20:56:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333777841] [2022-11-02 20:56:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333777841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:54,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:54,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:56:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469156439] [2022-11-02 20:56:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:54,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:56:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:56:54,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:56:54,194 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-02 20:56:54,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-02 20:56:54,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:54,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-02 20:56:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:54,512 INFO L130 PetriNetUnfolder]: 46/237 cut-off events. [2022-11-02 20:56:54,513 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-11-02 20:56:54,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 237 events. 46/237 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 820 event pairs, 13 based on Foata normal form. 7/243 useless extension candidates. Maximal degree in co-relation 544. Up to 36 conditions per place. [2022-11-02 20:56:54,515 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 20 selfloop transitions, 9 changer transitions 15/110 dead transitions. [2022-11-02 20:56:54,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 463 flow [2022-11-02 20:56:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:56:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 892 transitions. [2022-11-02 20:56:54,519 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8274582560296846 [2022-11-02 20:56:54,519 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 892 transitions. [2022-11-02 20:56:54,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 892 transitions. [2022-11-02 20:56:54,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:54,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 892 transitions. [2022-11-02 20:56:54,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.0909090909091) internal successors, (892), 11 states have internal predecessors, (892), 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-02 20:56:54,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:54,527 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:54,527 INFO L175 Difference]: Start difference. First operand has 108 places, 87 transitions, 256 flow. Second operand 11 states and 892 transitions. [2022-11-02 20:56:54,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 463 flow [2022-11-02 20:56:54,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 110 transitions, 393 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-11-02 20:56:54,533 INFO L231 Difference]: Finished difference. Result has 113 places, 90 transitions, 280 flow [2022-11-02 20:56:54,533 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=280, PETRI_PLACES=113, PETRI_TRANSITIONS=90} [2022-11-02 20:56:54,534 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 12 predicate places. [2022-11-02 20:56:54,534 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 90 transitions, 280 flow [2022-11-02 20:56:54,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-02 20:56:54,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:54,535 INFO L208 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-02 20:56:54,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:56:54,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1659441979, now seen corresponding path program 1 times [2022-11-02 20:56:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178598896] [2022-11-02 20:56:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:55,726 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-02 20:56:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:55,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178598896] [2022-11-02 20:56:55,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178598896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:55,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:55,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:56:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765359284] [2022-11-02 20:56:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:55,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:56:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:56:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:55,732 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-11-02 20:56:55,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 90 transitions, 280 flow. Second operand has 11 states, 11 states have (on average 75.72727272727273) internal successors, (833), 11 states have internal predecessors, (833), 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-02 20:56:55,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:55,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-11-02 20:56:55,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:56,092 INFO L130 PetriNetUnfolder]: 19/267 cut-off events. [2022-11-02 20:56:56,092 INFO L131 PetriNetUnfolder]: For 268/276 co-relation queries the response was YES. [2022-11-02 20:56:56,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 267 events. 19/267 cut-off events. For 268/276 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1248 event pairs, 2 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 545. Up to 43 conditions per place. [2022-11-02 20:56:56,094 INFO L137 encePairwiseOnDemand]: 88/98 looper letters, 19 selfloop transitions, 2 changer transitions 16/107 dead transitions. [2022-11-02 20:56:56,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 107 transitions, 400 flow [2022-11-02 20:56:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:56:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:56:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 775 transitions. [2022-11-02 20:56:56,098 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7908163265306123 [2022-11-02 20:56:56,099 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 775 transitions. [2022-11-02 20:56:56,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 775 transitions. [2022-11-02 20:56:56,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:56,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 775 transitions. [2022-11-02 20:56:56,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.5) internal successors, (775), 10 states have internal predecessors, (775), 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-02 20:56:56,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-02 20:56:56,106 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-02 20:56:56,106 INFO L175 Difference]: Start difference. First operand has 113 places, 90 transitions, 280 flow. Second operand 10 states and 775 transitions. [2022-11-02 20:56:56,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 107 transitions, 400 flow [2022-11-02 20:56:56,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 107 transitions, 373 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-02 20:56:56,113 INFO L231 Difference]: Finished difference. Result has 119 places, 90 transitions, 280 flow [2022-11-02 20:56:56,114 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=119, PETRI_TRANSITIONS=90} [2022-11-02 20:56:56,115 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 18 predicate places. [2022-11-02 20:56:56,115 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 90 transitions, 280 flow [2022-11-02 20:56:56,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.72727272727273) internal successors, (833), 11 states have internal predecessors, (833), 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-02 20:56:56,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:56,116 INFO L208 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-02 20:56:56,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:56:56,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:56:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -329289285, now seen corresponding path program 2 times [2022-11-02 20:56:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:56,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830463561] [2022-11-02 20:56:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:56:56,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:56:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:56:56,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:56:56,339 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:56:56,340 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-02 20:56:56,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-02 20:56:56,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-02 20:56:56,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-02 20:56:56,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-02 20:56:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:56:56,370 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-02 20:56:56,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:56:56,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:56:56,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:56:56 BasicIcfg [2022-11-02 20:56:56,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:56:56,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:56:56,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:56:56,542 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:56:56,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:48" (3/4) ... [2022-11-02 20:56:56,545 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:56:56,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:56:56,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:56:56,710 INFO L158 Benchmark]: Toolchain (without parser) took 10426.30ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 57.3MB in the beginning and 169.4MB in the end (delta: -112.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,710 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:56:56,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.29ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 57.7MB in the end (delta: -572.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.06ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 54.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,713 INFO L158 Benchmark]: Boogie Preprocessor took 74.39ms. Allocated memory is still 94.4MB. Free memory was 54.7MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,713 INFO L158 Benchmark]: RCFGBuilder took 1602.52ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 52.6MB in the beginning and 48.9MB in the end (delta: 3.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,714 INFO L158 Benchmark]: TraceAbstraction took 7696.94ms. Allocated memory was 117.4MB in the beginning and 237.0MB in the end (delta: 119.5MB). Free memory was 48.3MB in the beginning and 188.3MB in the end (delta: -140.0MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,714 INFO L158 Benchmark]: Witness Printer took 167.34ms. Allocated memory is still 237.0MB. Free memory was 188.3MB in the beginning and 169.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:56:56,717 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.20ms. Allocated memory is still 94.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.29ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 57.7MB in the end (delta: -572.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.06ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 54.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.39ms. Allocated memory is still 94.4MB. Free memory was 54.7MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1602.52ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 52.6MB in the beginning and 48.9MB in the end (delta: 3.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7696.94ms. Allocated memory was 117.4MB in the beginning and 237.0MB in the end (delta: 119.5MB). Free memory was 48.3MB in the beginning and 188.3MB in the end (delta: -140.0MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 167.34ms. Allocated memory is still 237.0MB. Free memory was 188.3MB in the beginning and 169.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=54, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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 5 procedures, 118 locations, 5 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: 7.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 472 IncrementalHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 36 mSDtfsCounter, 472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-02 20:56:56,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a0213a5-ee7a-479e-a6b2-a5e34be133b6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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