./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/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_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/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_f76a6cbe-102a-4449-b562-daa5647c45dc/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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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 19:55:57,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:55:57,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:55:57,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:55:57,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:55:57,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:55:57,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:55:57,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:55:57,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:55:57,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:55:57,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:55:57,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:55:57,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:55:57,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:55:57,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:55:57,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:55:57,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:55:57,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:55:57,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:55:57,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:55:57,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:55:57,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:55:57,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:55:57,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:55:57,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:55:57,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:55:57,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:55:57,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:55:57,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:55:57,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:55:57,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:55:57,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:55:57,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:55:57,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:55:57,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:55:57,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:55:57,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:55:57,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:55:57,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:55:57,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:55:57,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:55:57,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 19:55:57,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:55:57,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:55:57,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:55:57,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:55:57,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:55:57,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:55:57,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:55:57,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:55:57,846 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:55:57,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:55:57,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:55:57,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:55:57,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:55:57,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:55:57,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:55:57,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:55:57,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:55:57,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:55:57,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:55:57,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:55:57,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:55:57,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:55:57,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:55:57,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:55:57,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:55:57,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:55:57,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:55:57,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:55:57,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:55:57,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:55:57,854 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:55:57,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:55:57,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:55:57,855 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_f76a6cbe-102a-4449-b562-daa5647c45dc/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_f76a6cbe-102a-4449-b562-daa5647c45dc/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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-02 19:55:58,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:55:58,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:55:58,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:55:58,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:55:58,299 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:55:58,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-02 19:55:58,391 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/data/221007f8e/6d86c9f9ce694a74a8b07e9b0376cb5c/FLAGf71b6040c [2022-11-02 19:55:59,055 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:55:59,056 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-02 19:55:59,080 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/data/221007f8e/6d86c9f9ce694a74a8b07e9b0376cb5c/FLAGf71b6040c [2022-11-02 19:55:59,308 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/data/221007f8e/6d86c9f9ce694a74a8b07e9b0376cb5c [2022-11-02 19:55:59,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:55:59,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:55:59,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:55:59,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:55:59,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:55:59,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:59" (1/1) ... [2022-11-02 19:55:59,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0eb7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:59, skipping insertion in model container [2022-11-02 19:55:59,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:59" (1/1) ... [2022-11-02 19:55:59,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:55:59,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:55:59,670 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_f76a6cbe-102a-4449-b562-daa5647c45dc/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-02 19:55:59,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:55:59,982 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:56:00,004 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_f76a6cbe-102a-4449-b562-daa5647c45dc/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-02 19:56:00,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:56:00,178 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:56:00,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00 WrapperNode [2022-11-02 19:56:00,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:56:00,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:56:00,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:56:00,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:56:00,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,272 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2022-11-02 19:56:00,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:56:00,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:56:00,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:56:00,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:56:00,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,341 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:56:00,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:56:00,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:56:00,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:56:00,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (1/1) ... [2022-11-02 19:56:00,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:56:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:56:00,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:56:00,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:56:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:56:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 19:56:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:56:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 19:56:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:56:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 19:56:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 19:56:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 19:56:00,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 19:56:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 19:56:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 19:56:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:56:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 19:56:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:56:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:56:00,480 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 19:56:00,792 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:56:00,794 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:56:01,589 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:56:02,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:56:02,198 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 19:56:02,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:02 BoogieIcfgContainer [2022-11-02 19:56:02,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:56:02,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:56:02,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:56:02,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:56:02,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:55:59" (1/3) ... [2022-11-02 19:56:02,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a194420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:02, skipping insertion in model container [2022-11-02 19:56:02,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:00" (2/3) ... [2022-11-02 19:56:02,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a194420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:02, skipping insertion in model container [2022-11-02 19:56:02,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:02" (3/3) ... [2022-11-02 19:56:02,215 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-02 19:56:02,241 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 19:56:02,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:56:02,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 19:56:02,255 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 19:56:02,344 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 19:56:02,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-02 19:56:02,497 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-02 19:56:02,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 19:56:02,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-02 19:56:02,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-11-02 19:56:02,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-11-02 19:56:02,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:56:02,535 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;@4bc82dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:56:02,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 19:56:02,549 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-02 19:56:02,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 19:56:02,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:02,550 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 19:56:02,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -109892917, now seen corresponding path program 1 times [2022-11-02 19:56:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:02,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034916845] [2022-11-02 19:56:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,288 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 19:56:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:03,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034916845] [2022-11-02 19:56:03,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034916845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:03,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:03,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:56:03,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577603322] [2022-11-02 19:56:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:03,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:56:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:56:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:56:03,391 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 124 [2022-11-02 19:56:03,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 19:56:03,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:03,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 124 [2022-11-02 19:56:03,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:03,741 INFO L130 PetriNetUnfolder]: 58/313 cut-off events. [2022-11-02 19:56:03,741 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 19:56:03,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 313 events. 58/313 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1375 event pairs, 10 based on Foata normal form. 24/325 useless extension candidates. Maximal degree in co-relation 385. Up to 79 conditions per place. [2022-11-02 19:56:03,751 INFO L137 encePairwiseOnDemand]: 119/124 looper letters, 14 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-11-02 19:56:03,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 123 transitions, 293 flow [2022-11-02 19:56:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:56:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:56:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-11-02 19:56:03,779 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9435483870967742 [2022-11-02 19:56:03,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-11-02 19:56:03,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-11-02 19:56:03,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:03,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-11-02 19:56:03,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 19:56:03,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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 19:56:03,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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 19:56:03,823 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 251 flow. Second operand 3 states and 351 transitions. [2022-11-02 19:56:03,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 123 transitions, 293 flow [2022-11-02 19:56:03,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 288 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 19:56:03,840 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 244 flow [2022-11-02 19:56:03,843 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2022-11-02 19:56:03,849 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, -3 predicate places. [2022-11-02 19:56:03,850 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 244 flow [2022-11-02 19:56:03,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 19:56:03,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:03,851 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, 1, 1] [2022-11-02 19:56:03,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:56:03,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1185702391, now seen corresponding path program 1 times [2022-11-02 19:56:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580153203] [2022-11-02 19:56:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:04,598 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 19:56:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:04,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580153203] [2022-11-02 19:56:04,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580153203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:04,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:04,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469954604] [2022-11-02 19:56:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:04,613 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-11-02 19:56:04,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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 19:56:04,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:04,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-11-02 19:56:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:06,855 INFO L130 PetriNetUnfolder]: 1982/5016 cut-off events. [2022-11-02 19:56:06,855 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-11-02 19:56:06,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 5016 events. 1982/5016 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 42427 event pairs, 686 based on Foata normal form. 0/4858 useless extension candidates. Maximal degree in co-relation 8133. Up to 1568 conditions per place. [2022-11-02 19:56:06,884 INFO L137 encePairwiseOnDemand]: 116/124 looper letters, 31 selfloop transitions, 4 changer transitions 72/186 dead transitions. [2022-11-02 19:56:06,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 590 flow [2022-11-02 19:56:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:56:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1028 transitions. [2022-11-02 19:56:06,888 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8290322580645161 [2022-11-02 19:56:06,888 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1028 transitions. [2022-11-02 19:56:06,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1028 transitions. [2022-11-02 19:56:06,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:06,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1028 transitions. [2022-11-02 19:56:06,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.8) internal successors, (1028), 10 states have internal predecessors, (1028), 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 19:56:06,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:06,899 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:06,899 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 244 flow. Second operand 10 states and 1028 transitions. [2022-11-02 19:56:06,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 590 flow [2022-11-02 19:56:06,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 186 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:56:06,907 INFO L231 Difference]: Finished difference. Result has 140 places, 105 transitions, 240 flow [2022-11-02 19:56:06,907 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2022-11-02 19:56:06,908 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 11 predicate places. [2022-11-02 19:56:06,909 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 240 flow [2022-11-02 19:56:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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 19:56:06,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:06,910 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, 1, 1, 1, 1, 1] [2022-11-02 19:56:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:56:06,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 125456927, now seen corresponding path program 1 times [2022-11-02 19:56:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570584042] [2022-11-02 19:56:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:07,252 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 19:56:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570584042] [2022-11-02 19:56:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570584042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:07,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:07,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090358890] [2022-11-02 19:56:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:07,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:07,260 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-11-02 19:56:07,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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 19:56:07,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:07,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-11-02 19:56:07,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:08,398 INFO L130 PetriNetUnfolder]: 1291/2347 cut-off events. [2022-11-02 19:56:08,398 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2022-11-02 19:56:08,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2347 events. 1291/2347 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13551 event pairs, 268 based on Foata normal form. 60/2354 useless extension candidates. Maximal degree in co-relation 4949. Up to 1074 conditions per place. [2022-11-02 19:56:08,418 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 28 selfloop transitions, 6 changer transitions 52/165 dead transitions. [2022-11-02 19:56:08,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 165 transitions, 553 flow [2022-11-02 19:56:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:56:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1018 transitions. [2022-11-02 19:56:08,422 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8209677419354838 [2022-11-02 19:56:08,422 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1018 transitions. [2022-11-02 19:56:08,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1018 transitions. [2022-11-02 19:56:08,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:08,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1018 transitions. [2022-11-02 19:56:08,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 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 19:56:08,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:08,432 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:08,432 INFO L175 Difference]: Start difference. First operand has 140 places, 105 transitions, 240 flow. Second operand 10 states and 1018 transitions. [2022-11-02 19:56:08,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 165 transitions, 553 flow [2022-11-02 19:56:08,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 515 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-02 19:56:08,457 INFO L231 Difference]: Finished difference. Result has 129 places, 105 transitions, 248 flow [2022-11-02 19:56:08,457 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=248, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-11-02 19:56:08,458 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-11-02 19:56:08,459 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 248 flow [2022-11-02 19:56:08,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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 19:56:08,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:08,460 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:08,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:56:08,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash -770910057, now seen corresponding path program 1 times [2022-11-02 19:56:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:08,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586635717] [2022-11-02 19:56:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,803 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 19:56:08,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:08,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586635717] [2022-11-02 19:56:08,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586635717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:08,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:08,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341591951] [2022-11-02 19:56:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:08,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:08,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:08,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 124 [2022-11-02 19:56:08,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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 19:56:08,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:08,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 124 [2022-11-02 19:56:08,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:09,476 INFO L130 PetriNetUnfolder]: 354/917 cut-off events. [2022-11-02 19:56:09,477 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-11-02 19:56:09,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 917 events. 354/917 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4990 event pairs, 168 based on Foata normal form. 24/914 useless extension candidates. Maximal degree in co-relation 1684. Up to 239 conditions per place. [2022-11-02 19:56:09,484 INFO L137 encePairwiseOnDemand]: 118/124 looper letters, 21 selfloop transitions, 2 changer transitions 34/145 dead transitions. [2022-11-02 19:56:09,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 145 transitions, 466 flow [2022-11-02 19:56:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:56:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 19:56:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 977 transitions. [2022-11-02 19:56:09,489 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8754480286738351 [2022-11-02 19:56:09,489 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 977 transitions. [2022-11-02 19:56:09,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 977 transitions. [2022-11-02 19:56:09,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:09,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 977 transitions. [2022-11-02 19:56:09,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.55555555555556) internal successors, (977), 9 states have internal predecessors, (977), 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 19:56:09,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 19:56:09,501 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 19:56:09,501 INFO L175 Difference]: Start difference. First operand has 129 places, 105 transitions, 248 flow. Second operand 9 states and 977 transitions. [2022-11-02 19:56:09,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 145 transitions, 466 flow [2022-11-02 19:56:09,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 426 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-02 19:56:09,508 INFO L231 Difference]: Finished difference. Result has 129 places, 105 transitions, 244 flow [2022-11-02 19:56:09,509 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-11-02 19:56:09,512 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-11-02 19:56:09,512 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 244 flow [2022-11-02 19:56:09,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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 19:56:09,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:09,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:09,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:56:09,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2121742532, now seen corresponding path program 1 times [2022-11-02 19:56:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523703856] [2022-11-02 19:56:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:09,826 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 19:56:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:09,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523703856] [2022-11-02 19:56:09,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523703856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:09,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:09,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956746950] [2022-11-02 19:56:09,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:09,832 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-02 19:56:09,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 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 19:56:09,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:09,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-02 19:56:09,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:10,777 INFO L130 PetriNetUnfolder]: 917/1935 cut-off events. [2022-11-02 19:56:10,778 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-11-02 19:56:10,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1935 events. 917/1935 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12894 event pairs, 60 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 3579. Up to 481 conditions per place. [2022-11-02 19:56:10,795 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 31 selfloop transitions, 6 changer transitions 50/172 dead transitions. [2022-11-02 19:56:10,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 172 transitions, 556 flow [2022-11-02 19:56:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:56:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1089 transitions. [2022-11-02 19:56:10,799 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8782258064516129 [2022-11-02 19:56:10,800 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1089 transitions. [2022-11-02 19:56:10,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1089 transitions. [2022-11-02 19:56:10,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:10,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1089 transitions. [2022-11-02 19:56:10,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 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 19:56:10,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:10,808 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:10,808 INFO L175 Difference]: Start difference. First operand has 129 places, 105 transitions, 244 flow. Second operand 10 states and 1089 transitions. [2022-11-02 19:56:10,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 172 transitions, 556 flow [2022-11-02 19:56:10,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 172 transitions, 540 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-02 19:56:10,815 INFO L231 Difference]: Finished difference. Result has 130 places, 107 transitions, 282 flow [2022-11-02 19:56:10,816 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=107} [2022-11-02 19:56:10,820 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-11-02 19:56:10,820 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 107 transitions, 282 flow [2022-11-02 19:56:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 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 19:56:10,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:10,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:56:10,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1694801201, now seen corresponding path program 1 times [2022-11-02 19:56:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:10,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371781609] [2022-11-02 19:56:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:11,293 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 19:56:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371781609] [2022-11-02 19:56:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371781609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:11,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:11,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819922676] [2022-11-02 19:56:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:11,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:11,299 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-02 19:56:11,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 107 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 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 19:56:11,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:11,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-02 19:56:11,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:11,900 INFO L130 PetriNetUnfolder]: 316/855 cut-off events. [2022-11-02 19:56:11,900 INFO L131 PetriNetUnfolder]: For 700/706 co-relation queries the response was YES. [2022-11-02 19:56:11,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 855 events. 316/855 cut-off events. For 700/706 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4935 event pairs, 25 based on Foata normal form. 30/878 useless extension candidates. Maximal degree in co-relation 2056. Up to 182 conditions per place. [2022-11-02 19:56:11,908 INFO L137 encePairwiseOnDemand]: 115/124 looper letters, 37 selfloop transitions, 9 changer transitions 39/170 dead transitions. [2022-11-02 19:56:11,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 170 transitions, 711 flow [2022-11-02 19:56:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:56:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1087 transitions. [2022-11-02 19:56:11,912 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8766129032258064 [2022-11-02 19:56:11,912 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1087 transitions. [2022-11-02 19:56:11,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1087 transitions. [2022-11-02 19:56:11,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:11,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1087 transitions. [2022-11-02 19:56:11,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 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 19:56:11,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:11,920 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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 19:56:11,920 INFO L175 Difference]: Start difference. First operand has 130 places, 107 transitions, 282 flow. Second operand 10 states and 1087 transitions. [2022-11-02 19:56:11,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 170 transitions, 711 flow [2022-11-02 19:56:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 170 transitions, 687 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-02 19:56:11,927 INFO L231 Difference]: Finished difference. Result has 134 places, 110 transitions, 350 flow [2022-11-02 19:56:11,928 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2022-11-02 19:56:11,929 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 5 predicate places. [2022-11-02 19:56:11,929 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 350 flow [2022-11-02 19:56:11,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 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 19:56:11,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:11,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:11,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:56:11,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash -744956644, now seen corresponding path program 1 times [2022-11-02 19:56:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592246350] [2022-11-02 19:56:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,423 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 19:56:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:12,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592246350] [2022-11-02 19:56:12,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592246350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:12,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:12,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826758728] [2022-11-02 19:56:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:12,429 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-11-02 19:56:12,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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 19:56:12,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:12,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-11-02 19:56:12,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:13,374 INFO L130 PetriNetUnfolder]: 342/1136 cut-off events. [2022-11-02 19:56:13,374 INFO L131 PetriNetUnfolder]: For 1198/1258 co-relation queries the response was YES. [2022-11-02 19:56:13,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1136 events. 342/1136 cut-off events. For 1198/1258 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7105 event pairs, 39 based on Foata normal form. 29/1142 useless extension candidates. Maximal degree in co-relation 2700. Up to 379 conditions per place. [2022-11-02 19:56:13,389 INFO L137 encePairwiseOnDemand]: 108/124 looper letters, 38 selfloop transitions, 12 changer transitions 28/160 dead transitions. [2022-11-02 19:56:13,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 160 transitions, 620 flow [2022-11-02 19:56:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:56:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 19:56:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2022-11-02 19:56:13,395 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7925219941348973 [2022-11-02 19:56:13,395 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2022-11-02 19:56:13,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2022-11-02 19:56:13,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:13,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2022-11-02 19:56:13,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 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 19:56:13,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:13,405 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:13,405 INFO L175 Difference]: Start difference. First operand has 134 places, 110 transitions, 350 flow. Second operand 11 states and 1081 transitions. [2022-11-02 19:56:13,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 160 transitions, 620 flow [2022-11-02 19:56:13,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 160 transitions, 564 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-02 19:56:13,422 INFO L231 Difference]: Finished difference. Result has 139 places, 115 transitions, 377 flow [2022-11-02 19:56:13,422 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=139, PETRI_TRANSITIONS=115} [2022-11-02 19:56:13,423 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2022-11-02 19:56:13,423 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 115 transitions, 377 flow [2022-11-02 19:56:13,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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 19:56:13,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:13,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:56:13,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1816089236, now seen corresponding path program 2 times [2022-11-02 19:56:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:13,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531041641] [2022-11-02 19:56:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:13,895 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 19:56:13,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:13,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531041641] [2022-11-02 19:56:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531041641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:13,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416228564] [2022-11-02 19:56:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:13,906 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-11-02 19:56:13,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 115 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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 19:56:13,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:13,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-11-02 19:56:13,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:14,846 INFO L130 PetriNetUnfolder]: 432/1490 cut-off events. [2022-11-02 19:56:14,847 INFO L131 PetriNetUnfolder]: For 1386/1428 co-relation queries the response was YES. [2022-11-02 19:56:14,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 1490 events. 432/1490 cut-off events. For 1386/1428 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10413 event pairs, 95 based on Foata normal form. 37/1498 useless extension candidates. Maximal degree in co-relation 3742. Up to 432 conditions per place. [2022-11-02 19:56:14,864 INFO L137 encePairwiseOnDemand]: 108/124 looper letters, 44 selfloop transitions, 13 changer transitions 28/167 dead transitions. [2022-11-02 19:56:14,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 167 transitions, 766 flow [2022-11-02 19:56:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:56:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 19:56:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1080 transitions. [2022-11-02 19:56:14,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7917888563049853 [2022-11-02 19:56:14,869 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1080 transitions. [2022-11-02 19:56:14,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1080 transitions. [2022-11-02 19:56:14,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:14,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1080 transitions. [2022-11-02 19:56:14,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.18181818181819) internal successors, (1080), 11 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:56:14,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:14,877 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:14,877 INFO L175 Difference]: Start difference. First operand has 139 places, 115 transitions, 377 flow. Second operand 11 states and 1080 transitions. [2022-11-02 19:56:14,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 167 transitions, 766 flow [2022-11-02 19:56:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 167 transitions, 733 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-02 19:56:14,886 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 475 flow [2022-11-02 19:56:14,887 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2022-11-02 19:56:14,888 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-11-02 19:56:14,888 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 475 flow [2022-11-02 19:56:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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 19:56:14,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:14,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:14,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:56:14,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash -222684056, now seen corresponding path program 3 times [2022-11-02 19:56:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:14,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138615955] [2022-11-02 19:56:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:15,276 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 19:56:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138615955] [2022-11-02 19:56:15,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138615955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:15,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:15,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:56:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072263435] [2022-11-02 19:56:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:15,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:56:15,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:15,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:56:15,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:56:15,281 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-02 19:56:15,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 475 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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 19:56:15,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:56:15,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-02 19:56:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:56:16,045 INFO L130 PetriNetUnfolder]: 406/1312 cut-off events. [2022-11-02 19:56:16,046 INFO L131 PetriNetUnfolder]: For 2415/2437 co-relation queries the response was YES. [2022-11-02 19:56:16,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 1312 events. 406/1312 cut-off events. For 2415/2437 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9513 event pairs, 90 based on Foata normal form. 36/1294 useless extension candidates. Maximal degree in co-relation 3661. Up to 236 conditions per place. [2022-11-02 19:56:16,061 INFO L137 encePairwiseOnDemand]: 115/124 looper letters, 33 selfloop transitions, 14 changer transitions 24/165 dead transitions. [2022-11-02 19:56:16,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 165 transitions, 900 flow [2022-11-02 19:56:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:56:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 19:56:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1163 transitions. [2022-11-02 19:56:16,068 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8526392961876833 [2022-11-02 19:56:16,069 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1163 transitions. [2022-11-02 19:56:16,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1163 transitions. [2022-11-02 19:56:16,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:56:16,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1163 transitions. [2022-11-02 19:56:16,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.72727272727273) internal successors, (1163), 11 states have internal predecessors, (1163), 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 19:56:16,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:16,078 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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 19:56:16,083 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 475 flow. Second operand 11 states and 1163 transitions. [2022-11-02 19:56:16,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 165 transitions, 900 flow [2022-11-02 19:56:16,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 787 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-11-02 19:56:16,098 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 475 flow [2022-11-02 19:56:16,099 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2022-11-02 19:56:16,100 INFO L287 CegarLoopForPetriNet]: 129 programPoint places, 19 predicate places. [2022-11-02 19:56:16,100 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 475 flow [2022-11-02 19:56:16,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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 19:56:16,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:56:16,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:16,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:56:16,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 19:56:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash 229234905, now seen corresponding path program 1 times [2022-11-02 19:56:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:16,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905313801] [2022-11-02 19:56:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:56:16,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:56:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:56:16,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 19:56:16,270 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:56:16,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 19:56:16,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 19:56:16,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 19:56:16,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 19:56:16,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 19:56:16,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 19:56:16,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:56:16,276 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:16,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 19:56:16,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:56:16,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:56:16 BasicIcfg [2022-11-02 19:56:16,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:56:16,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:56:16,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:56:16,493 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:56:16,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:02" (3/4) ... [2022-11-02 19:56:16,496 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 19:56:16,713 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 19:56:16,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:56:16,714 INFO L158 Benchmark]: Toolchain (without parser) took 17400.84ms. Allocated memory was 107.0MB in the beginning and 656.4MB in the end (delta: 549.5MB). Free memory was 68.4MB in the beginning and 412.6MB in the end (delta: -344.2MB). Peak memory consumption was 204.9MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,714 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:56:16,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.12ms. Allocated memory is still 107.0MB. Free memory was 68.1MB in the beginning and 69.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.32ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 66.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,715 INFO L158 Benchmark]: Boogie Preprocessor took 89.52ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,716 INFO L158 Benchmark]: RCFGBuilder took 1838.24ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 64.1MB in the beginning and 63.4MB in the end (delta: 747.4kB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,716 INFO L158 Benchmark]: TraceAbstraction took 14287.02ms. Allocated memory was 142.6MB in the beginning and 656.4MB in the end (delta: 513.8MB). Free memory was 62.6MB in the beginning and 455.7MB in the end (delta: -393.1MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,717 INFO L158 Benchmark]: Witness Printer took 220.64ms. Allocated memory is still 656.4MB. Free memory was 455.7MB in the beginning and 412.6MB in the end (delta: 43.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-02 19:56:16,719 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.31ms. Allocated memory is still 107.0MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.12ms. Allocated memory is still 107.0MB. Free memory was 68.1MB in the beginning and 69.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.32ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 66.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.52ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1838.24ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 64.1MB in the beginning and 63.4MB in the end (delta: 747.4kB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14287.02ms. Allocated memory was 142.6MB in the beginning and 656.4MB in the end (delta: 513.8MB). Free memory was 62.6MB in the beginning and 455.7MB in the end (delta: -393.1MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. * Witness Printer took 220.64ms. Allocated memory is still 656.4MB. Free memory was 455.7MB in the beginning and 412.6MB in the end (delta: 43.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L723] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L724] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L725] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L726] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L727] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L728] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L729] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L735] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L736] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L737] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L738] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L739] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t38; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 539 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1008 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1204 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 132 mSDtfsCounter, 1204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 4301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 19:56:16,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76a6cbe-102a-4449-b562-daa5647c45dc/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE